Take b = 2.

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

3727 is prime. b^((n-1)/3727)-1 mod n = 740011, which is a unit, inverse 1677051.

(3727) divides n-1.

(3727)^2 > n.

n is prime by Pocklington's theorem.