Take b = 3.

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

31 is prime. b^((n-1)/31)-1 mod n = 346, which is a unit, inverse 152.

(31) divides n-1.

(31)^2 > n.

n is prime by Pocklington's theorem.