Take b = 2.

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

337 is prime. b^((n-1)/337)-1 mod n = 629, which is a unit, inverse 2482.

(337) divides n-1.

(337)^2 > n.

n is prime by Pocklington's theorem.