Primality proof for n = 25121:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=157.html>157 is prime.</a>
<br>b^((n-1)/157)-1 mod n = 2098, which is a unit, inverse 21924.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 15065, which is a unit, inverse 17849.
<p>(5 * 157) divides n-1.
<p>(5 * 157)^2 > n.
<p>n is prime by Pocklington's theorem.