Take b = 2.

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

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

(709) divides n-1.

(709)^2 > n.

n is prime by Pocklington's theorem.