Lines Matching full:divisor
446 size_t divisor = 3;
447 size_t square = divisor * divisor;
449 while (square < candidate && (candidate % divisor))
451 divisor++;
452 square += 4 * divisor;
453 divisor++;
456 return (candidate % divisor ? true : false);
