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