Primality proof for n = 30859:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=139.html>139 is prime.</a>
<br>b^((n-1)/139)-1 mod n = 28814, which is a unit, inverse 5870.
<p><a href=37.html>37 is prime.</a>
<br>b^((n-1)/37)-1 mod n = 7871, which is a unit, inverse 10813.
<p>(37 * 139) divides n-1.
<p>(37 * 139)^2 > n.
<p>n is prime by Pocklington's theorem.