Take b = 2.

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

7899817 is prime. b^((n-1)/7899817)-1 mod n = 14430637497, which is a unit, inverse 868474763.

(7899817) divides n-1.

(7899817)^2 > n.

n is prime by Pocklington's theorem.