Primality proof for n = 6271:
<p>Take b = 2.
<p>b^(n-1) mod n = 1.
<p><a href=19.html>19 is prime.</a>
<br>b^((n-1)/19)-1 mod n = 5016, which is a unit, inverse 4702.
<p><a href=11.html>11 is prime.</a>
<br>b^((n-1)/11)-1 mod n = 4365, which is a unit, inverse 1701.
<p>(11 * 19) divides n-1.
<p>(11 * 19)^2 > n.
<p>n is prime by Pocklington's theorem.