Primality proof for n = 1269391:
<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 = 1013683, which is a unit, inverse 232539.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 245059, which is a unit, inverse 553948.
<p>(19 * 131) divides n-1.
<p>(19 * 131)^2 > n.
<p>n is prime by Pocklington's theorem.