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