Primality proof for n = 419:
Take b = 2.
b^(n-1) mod n = 1.
19 is prime.
b^((n-1)/19)-1 mod n = 113, which is a unit, inverse 89.
11 is prime.
b^((n-1)/11)-1 mod n = 333, which is a unit, inverse 190.
(11 * 19) divides n-1.
(11 * 19)^2 > n.
n is prime by Pocklington's theorem.