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