Primality proof for n = 11393:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=89.html>89 is prime.</a>
<br>b^((n-1)/89)-1 mod n = 9674, which is a unit, inverse 9239.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 11391, which is a unit, inverse 5696.
<p>(2^7 * 89) divides n-1.
<p>(2^7 * 89)^2 > n.
<p>n is prime by Pocklington's theorem.