Take b = 2.

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

311 is prime. b^((n-1)/311)-1 mod n = 63, which is a unit, inverse 326.

(311) divides n-1.

(311)^2 > n.

n is prime by Pocklington's theorem.