Primality proof for n = 10909:
Take b = 2.
b^(n-1) mod n = 1.
101 is prime.
b^((n-1)/101)-1 mod n = 228, which is a unit, inverse 10287.
3 is prime.
b^((n-1)/3)-1 mod n = 9266, which is a unit, inverse 4183.
(3^3 * 101) divides n-1.
(3^3 * 101)^2 > n.
n is prime by Pocklington's theorem.