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