Primality proof for n = 1303:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=31.html>31 is prime.</a>
<br>b^((n-1)/31)-1 mod n = 1027, which is a unit, inverse 203.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 97, which is a unit, inverse 403.
<p>(7 * 31) divides n-1.
<p>(7 * 31)^2 > n.
<p>n is prime by Pocklington's theorem.