ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n>2n>2 be an integer and let ϵ>0\epsilon>0. For integers a1,…,ana_1,\dots,a_n satisfying

a1+⋯+an=0,a_1+\cdots+a_n=0,

with no proper subset having zero sum and with gcd⁡(a1,…,an)=1\gcd(a_1,\dots,a_n)=1, let rad⁡(r)\operatorname{rad}(r) denote the product of the distinct prime factors of rr. Browkin–Brzeziński conjecture. There exists a constant Cn,ϵC_{n,\epsilon} such that

max⁡(∣a1∣,…,∣an∣)≤Cn,ϵrad⁡(a1×⋯×an)2n−5+ϵ.\max(|a_1|,\dots,|a_n|)\leq C_{n,\epsilon}\operatorname{rad}(a_1\times\cdots\times a_n)^{2n-5+\epsilon}.

This is a proposed generalization of the ABC conjecture needed for the paper's main theorems. The source does not state a resolution, so its status is open.

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.