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