Primality proof for n = 29123:

Take b = 2.

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

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

(14561) divides n-1.

(14561)^2 > n.

n is prime by Pocklington's theorem.