Primality proof for n = 421:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 369, which is a unit, inverse 170.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 278, which is a unit, inverse 368.
<p>(5 * 7) divides n-1.
<p>(5 * 7)^2 > n.
<p>n is prime by Pocklington's theorem.