Primality proof for n = 105769:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=113.html>113 is prime.</a>
<br>b^((n-1)/113)-1 mod n = 17918, which is a unit, inverse 83934.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 50731, which is a unit, inverse 82906.
<p>(13 * 113) divides n-1.
<p>(13 * 113)^2 > n.
<p>n is prime by Pocklington's theorem.