Anonymous user
Miller–Rabin primality test: Difference between revisions
→Deterministic up to 341,550,071,728,321
Line 675:
return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13);
return witness(n, s, d, 2) && witness(n, s, d, 3) && witness(n, s, d, 5) && witness(n, s, d, 7) && witness(n, s, d, 11) && witness(n, s, d, 13) && witness(n, s, d, 17);
}</lang
Inspiration from http://stackoverflow.com/questions/4424374/determining-if-a-number-is-prime
=={{header|C sharp|C#}}==
Line 773 ⟶ 775:
}
}</lang>
=={{header|Common Lisp}}==
<lang lisp>(defun factor-out (number divisor)
| |||