Primality proof for n = 6553:
Take b = 2.
b^(n-1) mod n = 1.
13 is prime.
b^((n-1)/13)-1 mod n = 575, which is a unit, inverse 661.
3 is prime.
b^((n-1)/3)-1 mod n = 1943, which is a unit, inverse 3720.
(3^2 * 13) divides n-1.
(3^2 * 13)^2 > n.
n is prime by Pocklington's theorem.