Lines Matching full:potential

76 // potential primes = 210*k + indices[i], k >= 1
137 // potential primes.  All prime numbers are potential prime numbers.  However
138 // some potential prime numbers are not prime.  In an ideal world, all potential
140 // highest potential prime.  Then this number is tested for prime by dividing it
141 // by all potential prime numbers less than the sqrt of the candidate.
143 // This implementation defines potential primes as those numbers not divisible
144 // by 2, 3, 5, and 7.  Other (common) implementations define potential primes
145 // as those not divisible by 2.  A few other implementations define potential
147 // primes which the potential prime is not divisible by, the set of potential
149 // are fewer potential primes to search, and fewer potential primes to divide
189     // Start searching list of potential primes: L * k0 + indices[in]  in __next_prime()
191     // Select first potential prime >= n  in __next_prime()
199         // Divide n by all primes or potential primes (i) until:  in __next_prime()
200         //    1.  The division is even, so try next potential prime.  in __next_prime()
204         //    potential primes start with 211, so don't test against the last  in __next_prime()
215         // n wasn't divisible by small primes, try potential primes  in __next_prime()
555                 // This will loop i to the next "plane" of potential primes  in __next_prime()
560         // n is not prime.  Increment n to next potential prime.  in __next_prime()