Primality proof for n = 760939013:
Take b = 2.
b^(n-1) mod n = 1.
190234753 is prime. b^((n-1)/190234753)-1 mod n = 15, which is a unit, inverse 659480478.
(190234753) divides n-1.
(190234753)^2 > n.
n is prime by Pocklington's theorem.