Primality proof for n = 2269:
Take b = 2.
b^(n-1) mod n = 1.
7 is prime.
b^((n-1)/7)-1 mod n = 737, which is a unit, inverse 665.
3 is prime.
b^((n-1)/3)-1 mod n = 2185, which is a unit, inverse 27.
(3^4 * 7) divides n-1.
(3^4 * 7)^2 > n.
n is prime by Pocklington's theorem.