Primality proof for n = 1176035613847:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=103393.html>103393 is prime.</a>
<br>b^((n-1)/103393)-1 mod n = 675688275371, which is a unit, inverse 1034661117117.
<p><a href=25969.html>25969 is prime.</a>
<br>b^((n-1)/25969)-1 mod n = 901972567670, which is a unit, inverse 254810059669.
<p>(25969 * 103393) divides n-1.
<p>(25969 * 103393)^2 > n.
<p>n is prime by Pocklington's theorem.