Primality proof for n = 7541:
<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 = 4988, which is a unit, inverse 6838.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 1960, which is a unit, inverse 227.
<p>(13 * 29) divides n-1.
<p>(13 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.