Primality proof for n = 4139:
Take b = 2.
b^(n-1) mod n = 1.
2069 is prime. b^((n-1)/2069)-1 mod n = 3, which is a unit, inverse 1380.
(2069) divides n-1.
(2069)^2 > n.
n is prime by Pocklington's theorem.