Take b = 2.

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

421 is prime. b^((n-1)/421)-1 mod n = 15414, which is a unit, inverse 9539.

(421) divides n-1.

(421)^2 > n.

n is prime by Pocklington's theorem.