Take b = 2.

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

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

(239) divides n-1.

(239)^2 > n.

n is prime by Pocklington's theorem.