Primality proof for n = 3137:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 2662, which is a unit, inverse 317.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 3135, which is a unit, inverse 1568.
<p>(2^6 * 7^2) divides n-1.
<p>(2^6 * 7^2)^2 > n.
<p>n is prime by Pocklington's theorem.