Searched refs:divn (Results 1 – 1 of 1) sorted by relevance
593 size_t divn = 3; in is_prime() local594 size_t sq = divn * divn; in is_prime()598 while (sq < candidate && candidate % divn != 0) in is_prime()600 ++divn; in is_prime()601 sq += 4 * divn; in is_prime()602 ++divn; in is_prime()605 return candidate % divn != 0; in is_prime()
Completed in 4 milliseconds