Take b = 2.

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

2593 is prime. b^((n-1)/2593)-1 mod n = 1566413, which is a unit, inverse 176249.

(2593) divides n-1.

(2593)^2 > n.

n is prime by Pocklington's theorem.