Primality proof for n = 269:
Take b = 2.
b^(n-1) mod n = 1.
67 is prime. b^((n-1)/67)-1 mod n = 15, which is a unit, inverse 18.
(67) divides n-1.
(67)^2 > n.
n is prime by Pocklington's theorem.