Primality proof for n = 6367:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=1061.html>1061 is prime.</a>
<br>b^((n-1)/1061)-1 mod n = 63, which is a unit, inverse 4750.
<p>(1061) divides n-1.
<p>(1061)^2 > n.
<p>n is prime by Pocklington's theorem.