ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n\ge3. For integers x1,…,xnx_1,\ldots,x_n, write rad⁡(x1x2⋯xn)\operatorname{rad}(x_1x_2\cdots x_n) for the largest positive squarefree divisor of their product. The n-terms abc conjecture. There is a number MnM_n depending only on nn such that, given integers x1,…,xnx_1,\ldots,x_n satisfying

gcd⁡(x1,…,xn)=1,x1+⋯+xn=0,\gcd(x_1,\ldots,x_n)=1,\qquad x_1+\cdots+x_n=0,

and such that no proper subsum in the second relation vanishes, one has

max⁡1≤j≤n∣xj∣≤rad⁡(x1x2⋯xn)Mn.\max_{1\le j\le n}|x_j|\le \operatorname{rad}(x_1x_2\cdots x_n)^{M_n}.

Browkin and Brzeziński proposed this extension of the abc conjecture to nn terms. The source also records the sharper expected choice Mn=2n−5+ϵM_n=2n-5+\epsilon for every ϵ>0\epsilon>0, up to finitely many exceptions; no resolution status is supplied.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.