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