The ABC conjecture
Establish the ABC conjecture: For every ε > 0 there exists a constant Kε such that for any integers a, b, c with a + b = c, one has c ≤ Kε rad(abc)^{1+ε}, where rad(n) denotes the product of the distinct prime divisors of n.
References
Conjecture 12.1 (The ABC Conjecture). For every E > 0, there exists Ke such that for any integers a, b, c satisfying a + b = c, we have c ≤ Kerad(abc)1+€.
The well-known abc conjecture of Masser and Oesterlé asserts that, for any λ < 1, there are only finitely many abc triples of exponent λ.
Conjecture [ABC conjecture] For every positive real number $\varepsilon > 0$, there exist only finitely many triples of coprime integers $(a, b, c)$ such that $a+b = c$ and
c > rad(abc){1 + \varepsilon}.
Here, $rad(n) = \prod_{p|n} p$ is the product of all prime factors of $n$.
To study \mathcal P\cap \mathcal V, the odd primes (up to sign) that occur as \tau-values, we employ the celebrated $abc$ Conjecture of Masser and Oesterl e Exp.~694.
The following tantalizing assertion was conjectured by David Masser and Joseph Oesterle (see ) and is known as the $abc$-conjecture: For each $\varepsilon>0$, there exists an absolute constant $C(\varepsilon)>0$, such that for all primitive triples of $a,b,c$ integers (i.e. triples of integers with $\text{gcd}(a,b,c)=1$) satisfying $$a+b=c,$$ one has $$\max{a},{b},{c}}\leq C(\varepsilon)\cdot \prod_{p|a\cdot b\cdot c}p{1+\varepsilon}$$ where the product is over all the prime number $p$ dividing $a\cdot b\cdot c$.
(The abc conjecture) Given a fixed real number \varepsilon > 0, there exists a constant c_{\varepsilon} such that if a + b = c and \gcd(a, b, c) = 1, then c\leq c_{\varepsilon}\rad(abc){1+\varepsilon}."