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