Take b = 2.

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

127 is prime. b^((n-1)/127)-1 mod n = 1425, which is a unit, inverse 1568.

(127) divides n-1.

(127)^2 > n.

n is prime by Pocklington's theorem.