Primality proof for n = 641:
<p>Take b = 3.
<p>b^(n-1) mod n = 1.
<p><a href=5.html>5 is prime.</a>
<br>b^((n-1)/5)-1 mod n = 356, which is a unit, inverse 632.
<p><a href=2.html>2 is prime.</a>
<br>b^((n-1)/2)-1 mod n = 639, which is a unit, inverse 320.
<p>(2^7 * 5) divides n-1.
<p>(2^7 * 5)^2 > n.
<p>n is prime by Pocklington's theorem.