Take b = 2.

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

250361 is prime. b^((n-1)/250361)-1 mod n = 3, which is a unit, inverse 166908.

(250361) divides n-1.

(250361)^2 > n.

n is prime by Pocklington's theorem.