Take b = 2.

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

9839 is prime. b^((n-1)/9839)-1 mod n = 255, which is a unit, inverse 8643.

(9839) divides n-1.

(9839)^2 > n.

n is prime by Pocklington's theorem.