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