Primality proof for n = 2711:

Take b = 2.

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

271 is prime.
b^((n-1)/271)-1 mod n = 1023, which is a unit, inverse 2658.

(271) divides n-1.

(271)^2 > n.

n is prime by Pocklington's theorem.