Primality proof for n = 1468672999:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1399.html>1399 is prime.</a>
<br>b^((n-1)/1399)-1 mod n = 1030835878, which is a unit, inverse 1148455144.
<p><a href=313.html>313 is prime.</a>
<br>b^((n-1)/313)-1 mod n = 975356196, which is a unit, inverse 1464338507.
<p>(313 * 1399) divides n-1.
<p>(313 * 1399)^2 > n.
<p>n is prime by Pocklington's theorem.