Take b = 2.

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

11909 is prime. b^((n-1)/11909)-1 mod n = 3, which is a unit, inverse 7940.

(11909) divides n-1.

(11909)^2 > n.

n is prime by Pocklington's theorem.