Take b = 2.

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

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

(1439) divides n-1.

(1439)^2 > n.

n is prime by Pocklington's theorem.