Take b = 2.

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

11243 is prime. b^((n-1)/11243)-1 mod n = 163090, which is a unit, inverse 1145008.

(11243) divides n-1.

(11243)^2 > n.

n is prime by Pocklington's theorem.