Take b = 2.

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

39863 is prime. b^((n-1)/39863)-1 mod n = 1027596, which is a unit, inverse 670131.

(39863) divides n-1.

(39863)^2 > n.

n is prime by Pocklington's theorem.