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