ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥3n\geq 3. For an nn-tuple a=(a1,…,an)∈Zna=(a_1,\ldots,a_n)\in\mathbb{Z}^n with nonzero entries, write

q(a)=log⁡(max⁡{∣a1∣,…,∣an∣})log⁡rad⁡(a1⋯an),q(a)=\frac{\log(\max\{|a_1|,\ldots,|a_n|\})}{\log\operatorname{rad}(a_1\cdots a_n)},

and for a sequence A={a(1),a(2),…}A=\{a^{(1)},a^{(2)},\ldots\} of such tuples write QA=lim sup⁡k→∞q(a(k))Q_A=\limsup_{k\to\infty}q(a^{(k)}). Let R(n)R(n) be the set of nn-tuples (a1,…,an)∈Zn(a_1,\ldots,a_n)\in\mathbb{Z}^n satisfying the stated sum, subsum, and pairwise-coprimality conditions. Ramaekers's conjecture. For every n≥3n\geq 3, QR(n)=1Q_{R(n)}=1.

This is a strong generalisation of the abcabc-conjecture. The paper's abstract states that the conjecture is false for every n≥5n\geq 5, while the case n=3n=3 is equivalent to the abcabc-conjecture.

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.