Take b = 2.

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

2591 is prime. b^((n-1)/2591)-1 mod n = 73895, which is a unit, inverse 70933.

(2591) divides n-1.

(2591)^2 > n.

n is prime by Pocklington's theorem.