Searched refs:divn (Results 1 – 1 of 1) sorted by relevance

/locale/programs/
A D	simple-hash.c	279 unsigned long int divn = 3; in is_prime() local 280 unsigned long int sq = divn * divn; in is_prime() 282 while (sq < candidate && candidate % divn != 0) in is_prime() 284 ++divn; in is_prime() 285 sq += 4 * divn; in is_prime() 286 ++divn; in is_prime() 289 return candidate % divn != 0; in is_prime()

Completed in 4 milliseconds

Last Index update Sun Aug 20 00:31:31 CST 2023