Take b = 2.

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

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

(787) divides n-1.

(787)^2 > n.

n is prime by Pocklington's theorem.