Take b = 2.

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

15217 is prime. b^((n-1)/15217)-1 mod n = 2482492, which is a unit, inverse 360874.

(15217) divides n-1.

(15217)^2 > n.

n is prime by Pocklington's theorem.