Primality proof for n = 11131:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=53.html>53 is prime.</a>
<br>b^((n-1)/53)-1 mod n = 6734, which is a unit, inverse 7635.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 5841, which is a unit, inverse 5515.
<p>(7 * 53) divides n-1.
<p>(7 * 53)^2 > n.
<p>n is prime by Pocklington's theorem.