Take b = 2.

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

17923 is prime. b^((n-1)/17923)-1 mod n = 15, which is a unit, inverse 62134.

(17923) divides n-1.

(17923)^2 > n.

n is prime by Pocklington's theorem.