Take b = 2.

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

24821 is prime. b^((n-1)/24821)-1 mod n = 63, which is a unit, inverse 89829.

(24821) divides n-1.

(24821)^2 > n.

n is prime by Pocklington's theorem.