Primality proof for n = 168631:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=73.html>73 is prime.</a>
<br>b^((n-1)/73)-1 mod n = 12699, which is a unit, inverse 42015.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 50854, which is a unit, inverse 116328.
<p>(11 * 73) divides n-1.
<p>(11 * 73)^2 > n.
<p>n is prime by Pocklington's theorem.