Primality proof for n = 11369:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 1237, which is a unit, inverse 1397.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 5419, which is a unit, inverse 4068.
<p>(7^2 * 29) divides n-1.
<p>(7^2 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.