Take b = 2.

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

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

(18911) divides n-1.

(18911)^2 > n.

n is prime by Pocklington's theorem.