Primality proof for n = 995329:
<p>Take b = 7.
<p>b^(n-1) mod n = 1.
<p><a href=3.html>3 is prime.</a>
<br>b^((n-1)/3)-1 mod n = 496799, which is a unit, inverse 497952.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 995327, which is a unit, inverse 497664.
<p>(2^12 * 3^5) divides n-1.
<p>(2^12 * 3^5)^2 > n.
<p>n is prime by Pocklington's theorem.