Take b = 2.

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

3797 is prime. b^((n-1)/3797)-1 mod n = 32300, which is a unit, inverse 50673.

(3797) divides n-1.

(3797)^2 > n.

n is prime by Pocklington's theorem.