Take b = 2.

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

139 is prime. b^((n-1)/139)-1 mod n = 15, which is a unit, inverse 260.

(139) divides n-1.

(139)^2 > n.

n is prime by Pocklington's theorem.