Take b = 2.

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

457 is prime. b^((n-1)/457)-1 mod n = 25691, which is a unit, inverse 50989.

(457) divides n-1.

(457)^2 > n.

n is prime by Pocklington's theorem.