Take b = 2.

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

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

(12791) divides n-1.

(12791)^2 > n.

n is prime by Pocklington's theorem.