Primality proof for n = 135193:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=131.html>131 is prime.</a>
<br>b^((n-1)/131)-1 mod n = 91799, which is a unit, inverse 92296.
<p><a href=43.html>43 is prime.</a>
<br>b^((n-1)/43)-1 mod n = 132648, which is a unit, inverse 8340.
<p>(43 * 131) divides n-1.
<p>(43 * 131)^2 > n.
<p>n is prime by Pocklington's theorem.