Primality proof for n = 13441:
<p>Take b = 11.
<p>b^(n-1) mod n = 1.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 10661, which is a unit, inverse 1552.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 8732, which is a unit, inverse 1156.
<p><a href=3.html>3 is prime.</a>
<br>b^((n-1)/3)-1 mod n = 644, which is a unit, inverse 8745.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 13439, which is a unit, inverse 6720.
<p>(2^7 * 3 * 5 * 7) divides n-1.
<p>(2^7 * 3 * 5 * 7)^2 > n.
<p>n is prime by Pocklington's theorem.