Primality proof for n = 14633:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=59.html>59 is prime.</a>
<br>b^((n-1)/59)-1 mod n = 2174, which is a unit, inverse 12782.
<p><a href=31.html>31 is prime.</a>
<br>b^((n-1)/31)-1 mod n = 4627, which is a unit, inverse 12979.
<p>(31 * 59) divides n-1.
<p>(31 * 59)^2 > n.
<p>n is prime by Pocklington's theorem.