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