Primality proof for n = 4759:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 4018, which is a unit, inverse 4014.
<p><a href=13.html>13 is prime.</a>
<br>b^((n-1)/13)-1 mod n = 51, which is a unit, inverse 3266.
<p>(13 * 61) divides n-1.
<p>(13 * 61)^2 > n.
<p>n is prime by Pocklington's theorem.