Primality proof for n = 1427:
<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 = 488, which is a unit, inverse 810.
<p><a href=23.html>23 is prime.</a>
<br>b^((n-1)/23)-1 mod n = 964, which is a unit, inverse 1014.
<p>(23 * 31) divides n-1.
<p>(23 * 31)^2 > n.
<p>n is prime by Pocklington's theorem.