Take b = 2.

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

251 is prime. b^((n-1)/251)-1 mod n = 12183, which is a unit, inverse 25251.

(251) divides n-1.

(251)^2 > n.

n is prime by Pocklington's theorem.