N conjecture

In number theory, the n conjecture is a conjecture stated by Browkin & Brzeziński (1994) as a generalization of the abc conjecture to more than three integers.

Formulations

Given n≥3, let a1,a2,...,an∈ℤ satisfy three conditions:

(i) gcd⁡(a1,a2,...,an)=1
(ii) a1+a2+...+an=0
(iii) no proper subsum of a1,a2,...,an equals 0

First formulation

The n conjecture states that for every ε>0, there is a constant C depending on n and ε, such that:

max⁡(|a1|,|a2|,...,|an|)<Cn,εrad⁡(|a1|⋅|a2|⋅…⋅|an|)2n−5+ε

where rad⁡(m) denotes the radical of an integer m, defined as the product of the distinct prime factors of m.

Second formulation

Define the quality of a1,a2,...,an as

q(a1,a2,...,an)=log⁡(max⁡(|a1|,|a2|,...,|an|))log⁡(rad⁡(|a1|⋅|a2|⋅...⋅|an|))

The n conjecture states that lim sup⁡q(a1,a2,...,an)=2n−5.

Stronger form

A variant called strong n conjecture or Ramaekers conjecture was proposed by Ramaekers (2009). This variant of the conjecture provides a sharper quality estimate for n-tuples by replacing the assumption of setwise coprimeness of a1,a2,...,an with pairwise coprimeness of a1,a2,...,an. There are two formulations of the conjecture:

Given n≥3, let a1,a2,...,an∈ℤ satisfy three conditions:

(i) a1,a2,...,an are pairwise coprime
(ii) a1+a2+...+an=0
(iii) no proper subsum of a1,a2,...,an equals 0

First formulation

The strong n conjecture states that for every ε>0, there is a constant C depending on n and ε, such that:

max⁡(|a1|,|a2|,...,|an|)<Cn,εrad⁡(|a1|⋅|a2|⋅…⋅|an|)1+ε

Second formulation

Define the quality of a1,a2,...,an as

q(a1,a2,...,an)=log⁡(max⁡(|a1|,|a2|,...,|an|))log⁡(rad⁡(|a1|⋅|a2|⋅...⋅|an|))

The strong n conjecture states that:

lim sup⁡q(a1,a2,...,an)=1.

Hölzl, Kleine & Stephan (2025) have shown that for n≥5 the above limit superior is for odd n at least 5/3 and for even n is at least 5/4. For the cases n=3 (abc-conjecture) and n=4, they did not find any nontrivial lower bounds. It is also open whether there is a common constant upper bound above the limit superiors for all n≥3. For the exact status of the case n=3 see the article on the abc conjecture.