Take b = 2.

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

2711 is prime. b^((n-1)/2711)-1 mod n = 4095, which is a unit, inverse 18058.

(2711) divides n-1.

(2711)^2 > n.

n is prime by Pocklington's theorem.