Take b = 2.

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

4513 is prime. b^((n-1)/4513)-1 mod n = 1023, which is a unit, inverse 21617.

(4513) divides n-1.

(4513)^2 > n.

n is prime by Pocklington's theorem.