Primality proof for n = 40927:
Take b = 2.
b^(n-1) mod n = 1.
359 is prime. b^((n-1)/359)-1 mod n = 34315, which is a unit, inverse 37405.
(359) divides n-1.
(359)^2 > n.
n is prime by Pocklington's theorem.