Searched refs:divn (Results 1 – 1 of 1) sorted by relevance
58 size_t divn = 3; in is_prime() local59 size_t sq = divn * divn; in is_prime()61 while (sq < candidate && candidate % divn != 0) in is_prime()64 ++divn; in is_prime()65 sq += 4 * divn; in is_prime()68 ++divn; in is_prime()71 return candidate % divn != 0; in is_prime()