Primality proof for n = 2493961260309239103759479389479268332988451545120507:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=7724799505040016989101.html>7724799505040016989101 is prime.</a>
<br>b^((n-1)/7724799505040016989101)-1 mod n = 319519662324789031995206962933348789358290138186497, which is a unit, inverse 1956250694240882710373999620294000460179980700887910.
<p><a href=8874921343853306041.html>8874921343853306041 is prime.</a>
<br>b^((n-1)/8874921343853306041)-1 mod n = 819472459390238887837930581114858036516397011411923, which is a unit, inverse 909911173181723968364313609158077220351892015599484.
<p>(8874921343853306041 * 7724799505040016989101) divides n-1.
<p>(8874921343853306041 * 7724799505040016989101)^2 > n.
<p>n is prime by Pocklington's theorem.