Primality proof for n = 1667:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=17.html>17 is prime.</a>
<br>b^((n-1)/17)-1 mod n = 641, which is a unit, inverse 827.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 711, which is a unit, inverse 347.
<p>(7^2 * 17) divides n-1.
<p>(7^2 * 17)^2 > n.
<p>n is prime by Pocklington's theorem.