Take b = 2.

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

2791 is prime. b^((n-1)/2791)-1 mod n = 29390, which is a unit, inverse 110614.

(2791) divides n-1.

(2791)^2 > n.

n is prime by Pocklington's theorem.