Maple code example p.136 programming guide.

Explain the function of the word "divisible" in this maple code?

Why isn't divisible defined with an operator like -> ?

>L:= [seq( i, i=2..100)]:

> divisor := 2:

>while ( numelems( L ) > 0 )

do

divisible, L := selectremove( i->(i mod divisor = 0), L ):

n := numelems( divisible );

if ( n > 0 ) then

printf( "%d integer%s whose smallest prime divisor is %d\n",

n, `if`( n > 1, "s", "" ), divisor ):

end if;

divisor:=nextprime(divisor);

end do: