Take b = 2.

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

227 is prime. b^((n-1)/227)-1 mod n = 17439, which is a unit, inverse 25478.

(227) divides n-1.

(227)^2 > n.

n is prime by Pocklington's theorem.