Take b = 2.

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

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

(907) divides n-1.

(907)^2 > n.

n is prime by Pocklington's theorem.