Take b = 2.

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

211 is prime. b^((n-1)/211)-1 mod n = 4003, which is a unit, inverse 15408.

(211) divides n-1.

(211)^2 > n.

n is prime by Pocklington's theorem.