Primality proof for n = 704251:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=313.html>313 is prime.</a>
<br>b^((n-1)/313)-1 mod n = 148688, which is a unit, inverse 512127.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 574806, which is a unit, inverse 306580.
<p>(5^3 * 313) divides n-1.
<p>(5^3 * 313)^2 > n.
<p>n is prime by Pocklington's theorem.