Primality proof for n = 3258667:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=673.html>673 is prime.</a>
<br>b^((n-1)/673)-1 mod n = 1168941, which is a unit, inverse 2846429.
<p><a href=269.html>269 is prime.</a>
<br>b^((n-1)/269)-1 mod n = 385173, which is a unit, inverse 661060.
<p>(269 * 673) divides n-1.
<p>(269 * 673)^2 > n.
<p>n is prime by Pocklington's theorem.