Take b = 2.

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

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

(233) divides n-1.

(233)^2 > n.

n is prime by Pocklington's theorem.