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