Primality proof for n = 17519:
Take b = 2.
b^(n-1) mod n = 1.
461 is prime. b^((n-1)/461)-1 mod n = 14256, which is a unit, inverse 1004.
(461) divides n-1.
(461)^2 > n.
n is prime by Pocklington's theorem.