Take b = 2.

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

199 is prime. b^((n-1)/199)-1 mod n = 15, which is a unit, inverse 372.

(199) divides n-1.

(199)^2 > n.

n is prime by Pocklington's theorem.