Take b = 2.

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

1193 is prime. b^((n-1)/1193)-1 mod n = 16383, which is a unit, inverse 6629.

(1193) divides n-1.

(1193)^2 > n.

n is prime by Pocklington's theorem.