Primality proof for n = 504842927415879955942747:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=31937378989.html>31937378989 is prime.</a>
<br>b^((n-1)/31937378989)-1 mod n = 481425386021623961229324, which is a unit, inverse 361246053519525552877203.
<p><a href=102244957.html>102244957 is prime.</a>
<br>b^((n-1)/102244957)-1 mod n = 57438905949684667228320, which is a unit, inverse 200692158008846139750302.
<p>(102244957 * 31937378989) divides n-1.
<p>(102244957 * 31937378989)^2 > n.
<p>n is prime by Pocklington's theorem.