Primality proof for n = 9435271:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1861.html>1861 is prime.</a>
<br>b^((n-1)/1861)-1 mod n = 9391192, which is a unit, inverse 6646580.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 8852738, which is a unit, inverse 865631.
<p>(13^2 * 1861) divides n-1.
<p>(13^2 * 1861)^2 > n.
<p>n is prime by Pocklington's theorem.