Primality proof for n = 571:

Take b = 2.

b^(n-1) mod n = 1.

19 is prime.
b^((n-1)/19)-1 mod n = 305, which is a unit, inverse 410.

3 is prime.
b^((n-1)/3)-1 mod n = 460, which is a unit, inverse 36.

(3 * 19) divides n-1.

(3 * 19)^2 > n.

n is prime by Pocklington's theorem.