Primality proof for n = 14153:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 10466, which is a unit, inverse 4234.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 5482, which is a unit, inverse 1469.
<p>(29 * 61) divides n-1.
<p>(29 * 61)^2 > n.
<p>n is prime by Pocklington's theorem.