Primality proof for n = 408311:
Take b = 2.
b^(n-1) mod n = 1.
307 is prime.
b^((n-1)/307)-1 mod n = 128748, which is a unit, inverse 108503.
19 is prime.
b^((n-1)/19)-1 mod n = 266931, which is a unit, inverse 5288.
(19 * 307) divides n-1.
(19 * 307)^2 > n.
n is prime by Pocklington's theorem.