Take b = 2.

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

17957 is prime. b^((n-1)/17957)-1 mod n = 2727979, which is a unit, inverse 2272558.

(17957) divides n-1.

(17957)^2 > n.

n is prime by Pocklington's theorem.