Primality proof for n = 60901:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 11632, which is a unit, inverse 41482.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 53455, which is a unit, inverse 35636.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 53296, which is a unit, inverse 57906.
<p>(5^2 * 7 * 29) divides n-1.
<p>(5^2 * 7 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.