Take b = 2.

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

373 is prime. b^((n-1)/373)-1 mod n = 63, which is a unit, inverse 1777.

(373) divides n-1.

(373)^2 > n.

n is prime by Pocklington's theorem.