Lines Matching full:potential

26 // potential primes = 210*k + indices[i], k >= 1
40 // potential primes.  All prime numbers are potential prime numbers.  However
41 // some potential prime numbers are not prime.  In an ideal world, all potential
43 // highest potential prime.  Then this number is tested for prime by dividing it
44 // by all potential prime numbers less than the sqrt of the candidate.
46 // This implementation defines potential primes as those numbers not divisible
47 // by 2, 3, 5, and 7.  Other (common) implementations define potential primes
48 // as those not divisible by 2.  A few other implementations define potential
50 // primes which the potential prime is not divisible by, the set of potential
52 // are fewer potential primes to search, and fewer potential primes to divide
76   // Start searching list of potential primes: L * k0 + indices[in]
78   // Select first potential prime >= n
84     // Divide n by all primes or potential primes (i) until:
85     //    1.  The division is even, so try next potential prime.
89     //    potential primes start with 211, so don't test against the last
99     // n wasn't divisible by small primes, try potential primes
438         // This will loop i to the next "plane" of potential primes
443     // n is not prime.  Increment n to next potential prime.