Primality proof for n = 394049:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=131.html>131 is prime.</a>
<br>b^((n-1)/131)-1 mod n = 283074, which is a unit, inverse 332528.
<p><a href=47.html>47 is prime.</a>
<br>b^((n-1)/47)-1 mod n = 340628, which is a unit, inverse 257949.
<p>(47 * 131) divides n-1.
<p>(47 * 131)^2 > n.
<p>n is prime by Pocklington's theorem.