Take b = 2.

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

37 is prime. b^((n-1)/37)-1 mod n = 305, which is a unit, inverse 35.

(37) divides n-1.

(37)^2 > n.

n is prime by Pocklington's theorem.