Take b = 2.

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

241 is prime. b^((n-1)/241)-1 mod n = 63, which is a unit, inverse 735.

(241) divides n-1.

(241)^2 > n.

n is prime by Pocklington's theorem.