Primality proof for n = 8663:
<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 = 1651, which is a unit, inverse 913.
<p><a href=61.html>61 is prime.</a>
<br>b^((n-1)/61)-1 mod n = 2734, which is a unit, inverse 1353.
<p>(61 * 71) divides n-1.
<p>(61 * 71)^2 > n.
<p>n is prime by Pocklington's theorem.