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