Primality proof for n = 4513:

Take b = 5.

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

47 is prime.
b^((n-1)/47)-1 mod n = 553, which is a unit, inverse 3803.

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

(2^5 * 47) divides n-1.

(2^5 * 47)^2 > n.

n is prime by Pocklington's theorem.