Take b = 2.

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

438281 is prime. b^((n-1)/438281)-1 mod n = 262143, which is a unit, inverse 2530525.

(438281) divides n-1.

(438281)^2 > n.

n is prime by Pocklington's theorem.