Primality proof for n = 49712609355733181957277501974736893:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=719569513687.html>719569513687 is prime.</a>
<br>b^((n-1)/719569513687)-1 mod n = 3682321743096489226585743440975125, which is a unit, inverse 26510255626462026520920073970749131.
<p><a href=151499460061.html>151499460061 is prime.</a>
<br>b^((n-1)/151499460061)-1 mod n = 48671800463545980605052623112158222, which is a unit, inverse 27928040730318928714495288851105246.
<p>(151499460061 * 719569513687) divides n-1.
<p>(151499460061 * 719569513687)^2 > n.
<p>n is prime by Pocklington's theorem.