Take b = 2.

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

673 is prime. b^((n-1)/673)-1 mod n = 120996, which is a unit, inverse 11350.

(673) divides n-1.

(673)^2 > n.

n is prime by Pocklington's theorem.