Primality proof for n = 1075060097:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=12517.html>12517 is prime.</a>
<br>b^((n-1)/12517)-1 mod n = 134734877, which is a unit, inverse 282938091.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 14276112, which is a unit, inverse 551211956.
<p>(61 * 12517) divides n-1.
<p>(61 * 12517)^2 > n.
<p>n is prime by Pocklington's theorem.