Take b = 2.

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

733 is prime. b^((n-1)/733)-1 mod n = 64213, which is a unit, inverse 116097.

(733) divides n-1.

(733)^2 > n.

n is prime by Pocklington's theorem.