Primality proof for n = 2729:

Take b = 2.

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

31 is prime.
b^((n-1)/31)-1 mod n = 2601, which is a unit, inverse 533.

11 is prime.
b^((n-1)/11)-1 mod n = 1118, which is a unit, inverse 1716.

(11 * 31) divides n-1.

(11 * 31)^2 > n.

n is prime by Pocklington's theorem.