Primality proof for n = 9151:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 1524, which is a unit, inverse 3921.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 2004, which is a unit, inverse 516.
<p>(5^2 * 61) divides n-1.
<p>(5^2 * 61)^2 > n.
<p>n is prime by Pocklington's theorem.