Take b = 2.

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

593 is prime. b^((n-1)/593)-1 mod n = 63, which is a unit, inverse 113.

(593) divides n-1.

(593)^2 > n.

n is prime by Pocklington's theorem.