Primality proof for n = 38861:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=67.html>67 is prime.</a>
<br>b^((n-1)/67)-1 mod n = 26615, which is a unit, inverse 5766.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 15932, which is a unit, inverse 30780.
<p>(29 * 67) divides n-1.
<p>(29 * 67)^2 > n.
<p>n is prime by Pocklington's theorem.