Take b = 2.

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

149 is prime. b^((n-1)/149)-1 mod n = 9993, which is a unit, inverse 243.

(149) divides n-1.

(149)^2 > n.

n is prime by Pocklington's theorem.