Take b = 2.

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

157 is prime. b^((n-1)/157)-1 mod n = 1023, which is a unit, inverse 43.

(157) divides n-1.

(157)^2 > n.

n is prime by Pocklington's theorem.