Take b = 2.

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

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

(760939013) divides n-1.

(760939013)^2 > n.

n is prime by Pocklington's theorem.