Primality proof for n = 929:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=29.html>29 is prime.</a>
<br>b^((n-1)/29)-1 mod n = 346, which is a unit, inverse 733.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 927, which is a unit, inverse 464.
<p>(2^5 * 29) divides n-1.
<p>(2^5 * 29)^2 > n.
<p>n is prime by Pocklington's theorem.