New Frontier
Hi CRGreathouse
The algorithm is very clear.
ALL primes are covered tested to M34 2^1,257,7871, Seriously!
ALL composites are identified!
Time O(log n) Very very fast. Serious.
ALL primes are defined NO false primes expected as per algorithm logic.
The algorith is a logical formulation, so can be verified quickly.
If authenticated, will compare to simplicity of Euclid's Proof for Infinite number of Primes.
If true, will be a new frontier in PNT
Call me crazy
Last fiddled with by gophne on 20171227 at 18:36
Reason: Correction for M34 2^1,257,7871
