n conjecture

From HandWiki
Short description: Generalization of the abc conjecture to more than three integers


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

Formulations

Given n3, 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|)2n5+ε

where rad(m) denotes the radical of the 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 supq(a1,a2,...,an)=2n5.

Stronger form

(Vojta 1998) proposed a stronger variant of the n conjecture, where setwise coprimeness of a1,a2,...,an is replaced by pairwise coprimeness of a1,a2,...,an.

There are two different formulations of this strong n conjecture.

Given n3, 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 supq(a1,a2,...,an)=1.

References