Primality proof for n = 11311:

Take b = 2.

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

29 is prime.
b^((n-1)/29)-1 mod n = 7403, which is a unit, inverse 9120.

13 is prime.
b^((n-1)/13)-1 mod n = 3978, which is a unit, inverse 2215.

(13 * 29) divides n-1.

(13 * 29)^2 > n.

n is prime by Pocklington's theorem.