Primality proof for n = 761:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 635, which is a unit, inverse 610.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 66, which is a unit, inverse 565.
<p>(5 * 19) divides n-1.
<p>(5 * 19)^2 > n.
<p>n is prime by Pocklington's theorem.