Take b = 2.

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

2437 is prime. b^((n-1)/2437)-1 mod n = 15, which is a unit, inverse 650.

(2437) divides n-1.

(2437)^2 > n.

n is prime by Pocklington's theorem.