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