Primality proof for n = 1288531:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=139.html>139 is prime.</a>
<br>b^((n-1)/139)-1 mod n = 974056, which is a unit, inverse 578537.
<p><a href=103.html>103 is prime.</a>
<br>b^((n-1)/103)-1 mod n = 685617, which is a unit, inverse 338714.
<p>(103 * 139) divides n-1.
<p>(103 * 139)^2 > n.
<p>n is prime by Pocklington's theorem.