Take b = 2.

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

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

(8999) divides n-1.

(8999)^2 > n.

n is prime by Pocklington's theorem.