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