Primality proof for n = 16693:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=107.html>107 is prime.</a>
<br>b^((n-1)/107)-1 mod n = 3503, which is a unit, inverse 15373.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 4955, which is a unit, inverse 2840.
<p>(13 * 107) divides n-1.
<p>(13 * 107)^2 > n.
<p>n is prime by Pocklington's theorem.