Primality proof for n = 4481:
<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 = 1590, which is a unit, inverse 4450.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 474, which is a unit, inverse 917.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 4479, which is a unit, inverse 2240.
<p>(2^7 * 5 * 7) divides n-1.
<p>(2^7 * 5 * 7)^2 > n.
<p>n is prime by Pocklington's theorem.