Take b = 2.

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

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

(151) divides n-1.

(151)^2 > n.

n is prime by Pocklington's theorem.