Primality proof for n = 3359:
Take b = 2.
b^(n-1) mod n = 1.
73 is prime. b^((n-1)/73)-1 mod n = 162, which is a unit, inverse 1016.
(73) divides n-1.
(73)^2 > n.
n is prime by Pocklington's theorem.