Primality proof for n = 14741:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=67.html>67 is prime.</a>
<br>b^((n-1)/67)-1 mod n = 11248, which is a unit, inverse 12019.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 2613, which is a unit, inverse 5286.
<p>(11 * 67) divides n-1.
<p>(11 * 67)^2 > n.
<p>n is prime by Pocklington's theorem.