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