Primality proof for n = 9461:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=43.html>43 is prime.</a>
<br>b^((n-1)/43)-1 mod n = 9055, which is a unit, inverse 8692.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 2133, which is a unit, inverse 5367.
<p>(11 * 43) divides n-1.
<p>(11 * 43)^2 > n.
<p>n is prime by Pocklington's theorem.