Searched refs:divn (Results 1 – 1 of 1) sorted by relevance
38 size_t divn = 3; in is_prime() local39 size_t sq = divn * divn; in is_prime()41 while (sq < candidate && candidate % divn != 0) in is_prime()44 ++divn; in is_prime()45 sq += 4 * divn; in is_prime()48 ++divn; in is_prime()51 return candidate % divn != 0; in is_prime()