Primality proof for n = 29:

Take b = 2.

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

7 is prime.
b^((n-1)/7)-1 mod n = 15, which is a unit, inverse 2.

(7) divides n-1.

(7)^2 > n.

n is prime by Pocklington's theorem.