Primality proof for n = 9049:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 5938, which is a unit, inverse 4174.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 3978, which is a unit, inverse 8337.
<p>(13 * 29) divides n-1.
<p>(13 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.