BB> To put it simply 1 & 2 are starting primes, so every second bit is
 BB> reset,  then every odd third bit that is still a 1, then every 
 BB> fifth odd bit beyond 6 that is still a 1, then every 7th 
 BB> bit that is still a 1, then every 11th bit and so on. It's 
 BB> astonishing how quickly the loops terminate.

   Yeah, that's a great idea.  Sometimes people insist on looking for an 
   overly complicated solution, and ignore the brutally simple one staring 
   them in the face.
   
   Bitwise operations instead of divisions and such?  No wonder it executes 
   fast.  :>
   
... RAM = Rarely Adequate Memory
___ Blue Wave/DOS v2.30 [NR]

--- Maximus 2.01wb