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