Take b = 2.

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

571 is prime. b^((n-1)/571)-1 mod n = 20454, which is a unit, inverse 19976.

(571) divides n-1.

(571)^2 > n.

n is prime by Pocklington's theorem.