Primality proof for n = 24709:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=71.html>71 is prime.</a>
<br>b^((n-1)/71)-1 mod n = 18360, which is a unit, inverse 15034.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 6264, which is a unit, inverse 15096.
<p>(29 * 71) divides n-1.
<p>(29 * 71)^2 > n.
<p>n is prime by Pocklington's theorem.