Primality proof for n = 463:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 157, which is a unit, inverse 174.
<p><a href=7.html>7 is prime.</a>
<br>b^((n-1)/7)-1 mod n = 117, which is a unit, inverse 186.
<p>(7 * 11) divides n-1.
<p>(7 * 11)^2 > n.
<p>n is prime by Pocklington's theorem.