Take b = 2.

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

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

(293) divides n-1.

(293)^2 > n.

n is prime by Pocklington's theorem.