Primality proof for n = 449:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 323, which is a unit, inverse 253.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 447, which is a unit, inverse 224.
<p>(2^6 * 7) divides n-1.
<p>(2^6 * 7)^2 > n.
<p>n is prime by Pocklington's theorem.