Primality proof for n = 5113:
<p>Take b = 5.
<p>b^(n-1) mod n = 1.
<p><a href=71.html>71 is prime.</a>
<br>b^((n-1)/71)-1 mod n = 5104, which is a unit, inverse 568.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 5111, which is a unit, inverse 2556.
<p>(2^3 * 71) divides n-1.
<p>(2^3 * 71)^2 > n.
<p>n is prime by Pocklington's theorem.