Take b = 2.

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

1117 is prime. b^((n-1)/1117)-1 mod n = 104137, which is a unit, inverse 206965.

(1117) divides n-1.

(1117)^2 > n.

n is prime by Pocklington's theorem.