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