Take b = 2.

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

2731 is prime. b^((n-1)/2731)-1 mod n = 228862, which is a unit, inverse 95101.

(2731) divides n-1.

(2731)^2 > n.

n is prime by Pocklington's theorem.