Take b = 2.

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

619 is prime. b^((n-1)/619)-1 mod n = 15, which is a unit, inverse 1156.

(619) divides n-1.

(619)^2 > n.

n is prime by Pocklington's theorem.