Fast Primes

[Kernelpanic]

A quick little method to get prime numbers from 2 to a little over 1,000,000.

Note that this saves no tables, no values.  Uses almost no memory.  It's just direct elimination in the most efficient manner possible, for values from 2 to a little over 1,000,000.  If someone wanted, they could continue this to go further, but it's all I need at the moment for my personal purposes, so I'll just post it as is and leave it for others to work on and enjoy if they ever want to. 

I get an error message here, the _Orelse num is not recognized as a command word; remains white.