Primality proof for n = 194995755782084489:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=14878771.html>14878771 is prime.</a>
<br>b^((n-1)/14878771)-1 mod n = 48041758379890202, which is a unit, inverse 157843789276174592.
<p><a href=10273.html>10273 is prime.</a>
<br>b^((n-1)/10273)-1 mod n = 55507690111326546, which is a unit, inverse 130776938136010960.
<p>(10273 * 14878771) divides n-1.
<p>(10273 * 14878771)^2 > n.
<p>n is prime by Pocklington's theorem.