Take b = 2.

b^(n-1) mod n = 1.

3413 is prime. b^((n-1)/3413)-1 mod n = 6273929, which is a unit, inverse 6605832.

(3413) divides n-1.

(3413)^2 > n.

n is prime by Pocklington's theorem.