Take b = 2.

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

24019 is prime. b^((n-1)/24019)-1 mod n = 75811056, which is a unit, inverse 117800574.

(24019) divides n-1.

(24019)^2 > n.

n is prime by Pocklington's theorem.