Take b = 2.

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

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

(919) divides n-1.

(919)^2 > n.

n is prime by Pocklington's theorem.