Take b = 2.

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

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

(607) divides n-1.

(607)^2 > n.

n is prime by Pocklington's theorem.