Primality proof for n = 4363:

Take b = 2.

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

727 is prime.
b^((n-1)/727)-1 mod n = 63, which is a unit, inverse 4086.

(727) divides n-1.

(727)^2 > n.

n is prime by Pocklington's theorem.