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