Primality proof for n = 1451:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 346, which is a unit, inverse 1321.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 711, which is a unit, inverse 100.
<p>(5^2 * 29) divides n-1.
<p>(5^2 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.