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