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