Primality proof for n = 35677501:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=71.html>71 is prime.</a>
<br>b^((n-1)/71)-1 mod n = 34211506, which is a unit, inverse 18887383.
<p><a href=67.html>67 is prime.</a>
<br>b^((n-1)/67)-1 mod n = 4147432, which is a unit, inverse 1281082.
<p><a href=3.html>3 is prime.</a>
<br>b^((n-1)/3)-1 mod n = 30453007, which is a unit, inverse 1741497.
<p>(3 * 67 * 71) divides n-1.
<p>(3 * 67 * 71)^2 > n.
<p>n is prime by Pocklington's theorem.