Primality proof for n = 132049:
<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 = 44008, which is a unit, inverse 116203.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 31671, which is a unit, inverse 110168.
<p>(7 * 131) divides n-1.
<p>(7 * 131)^2 > n.
<p>n is prime by Pocklington's theorem.