Primality proof for n = 1103:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 362, which is a unit, inverse 454.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 619, which is a unit, inverse 335.
<p>(19 * 29) divides n-1.
<p>(19 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.