Primality proof for n = 1597:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 2, which is a unit, inverse 799.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 318, which is a unit, inverse 1140.
<p>(7 * 19) divides n-1.
<p>(7 * 19)^2 > n.
<p>n is prime by Pocklington's theorem.