Primality proof for n = 10067:
Take b = 2.
b^(n-1) mod n = 1.
719 is prime. b^((n-1)/719)-1 mod n = 6316, which is a unit, inverse 3234.
(719) divides n-1.
(719)^2 > n.
n is prime by Pocklington's theorem.