Primality proof for n = 13009:
Take b = 2.
b^(n-1) mod n = 1.
271 is prime. b^((n-1)/271)-1 mod n = 1879, which is a unit, inverse 3704.
(271) divides n-1.
(271)^2 > n.
n is prime by Pocklington's theorem.