Primality proof for n = 9105937:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=661.html>661 is prime.</a>
<br>b^((n-1)/661)-1 mod n = 8058054, which is a unit, inverse 8867705.
<p><a href=41.html>41 is prime.</a>
<br>b^((n-1)/41)-1 mod n = 5328277, which is a unit, inverse 8050327.
<p>(41 * 661) divides n-1.
<p>(41 * 661)^2 > n.
<p>n is prime by Pocklington's theorem.