Primality proof for n = 607:
Take b = 2.
b^(n-1) mod n = 1.
101 is prime. b^((n-1)/101)-1 mod n = 63, which is a unit, inverse 106.
(101) divides n-1.
(101)^2 > n.
n is prime by Pocklington's theorem.