Primality proof for n = 298908837206431:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=752881.html>752881 is prime.</a>
<br>b^((n-1)/752881)-1 mod n = 195401171245607, which is a unit, inverse 48391663153048.
<p><a href=157.html>157 is prime.</a>
<br>b^((n-1)/157)-1 mod n = 39253511115524, which is a unit, inverse 66705492092546.
<p>(157 * 752881) divides n-1.
<p>(157 * 752881)^2 > n.
<p>n is prime by Pocklington's theorem.