Primality proof for n = 709:
Take b = 2.
b^(n-1) mod n = 1.
59 is prime. b^((n-1)/59)-1 mod n = 550, which is a unit, inverse 272.
(59) divides n-1.
(59)^2 > n.
n is prime by Pocklington's theorem.