Primality proof for n = 10453:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=67.html>67 is prime.</a>
<br>b^((n-1)/67)-1 mod n = 5486, which is a unit, inverse 7875.
<p><a href=3.html>3 is prime.</a>
<br>b^((n-1)/3)-1 mod n = 10181, which is a unit, inverse 3574.
<p>(3 * 67) divides n-1.
<p>(3 * 67)^2 > n.
<p>n is prime by Pocklington's theorem.