Take b = 2.

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

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

(281) divides n-1.

(281)^2 > n.

n is prime by Pocklington's theorem.