Primality proof for n = 14593:
<p>Take b = 5.
<p>b^(n-1) mod n = 1.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 6036, which is a unit, inverse 1013.
<p><a href=3.html>3 is prime.</a>
<br>b^((n-1)/3)-1 mod n = 6682, which is a unit, inverse 2636.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 14591, which is a unit, inverse 7296.
<p>(2^8 * 3 * 19) divides n-1.
<p>(2^8 * 3 * 19)^2 > n.
<p>n is prime by Pocklington's theorem.