Primality proof for n = 13037:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=3259.html>3259 is prime.</a>
<br>b^((n-1)/3259)-1 mod n = 15, which is a unit, inverse 6084.
<p>(3259) divides n-1.
<p>(3259)^2 > n.
<p>n is prime by Pocklington's theorem.