Primality proof for n = 135049:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=331.html>331 is prime.</a>
<br>b^((n-1)/331)-1 mod n = 43427, which is a unit, inverse 87323.
<p><a href=17.html>17 is prime.</a>
<br>b^((n-1)/17)-1 mod n = 122808, which is a unit, inverse 40379.
<p>(17 * 331) divides n-1.
<p>(17 * 331)^2 > n.
<p>n is prime by Pocklington's theorem.