Primality proof for n = 397:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 289, which is a unit, inverse 136.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 395, which is a unit, inverse 198.
<p>(2^2 * 11) divides n-1.
<p>(2^2 * 11)^2 > n.
<p>n is prime by Pocklington's theorem.