Primality proof for n = 11:

Take b = 2.

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

5 is prime.
b^((n-1)/5)-1 mod n = 3, which is a unit, inverse 4.

(5) divides n-1.

(5)^2 > n.

n is prime by Pocklington's theorem.