For pairwise coprime non-zero integers x1,x2,x3,x4x_1,x_2,x_3,x_4 with x1+x2+x3+x4=0x_1+x_2+x_3+x_4=0, no unconditional bound — not even an exponential one — is known that controls H=max⁡j∣xj∣H=\max_j|x_j| in terms of the radical R=rad⁡(x1x2x3x4)R=\operatorname{rad}(x_1x_2x_3x_4) without auxiliary hypotheses on the sizes of subsums; the only unconditional result (Pasten–Sepúlveda-Manzo, 2024) assumes some pairwise subsum is at most H/exp⁡((log⁡H)τlog⁡2∗H)H/\exp((\log H)^\tau\log_2^*H). The problem asks for an unconditional explicit bound of HH in terms of RR (of subexponential shape log⁡H≤exp⁡(o(log⁡R))\log H\le\exp(o(\log R)) as R→∞R\to\infty ideally, but any explicit bound resolves the main gap), with no such size hypothesis, and more generally for the nn-term conjectures with n≥4n\ge4. A related intermediate question raised by the same authors is whether the exponential-shape bound log⁡c≤exp⁡(τ−1κ⋅(log⁡3∗rad⁡(bc)/log⁡2∗rad⁡(bc))⋅log⁡rad⁡(bc))\log c\le\exp(\tau^{-1}\kappa\cdot(\log_3^*\operatorname{rad}(bc)/\log_2^*\operatorname{rad}(bc))\cdot\log\operatorname{rad}(bc)), which depends only on rad⁡(bc)\operatorname{rad}(bc), can be improved to something similar to the square-root shape of the rad⁡(abc)\operatorname{rad}(abc)-based bound; that intermediate concerns three-term equations and retains a size hypothesis on aa, so it is an input towards the main gap rather than a substitute for it. No resolution of any part of this is known in the literature to date.

Background

For a non-zero integer nn, its radical rad⁡(n)\operatorname{rad}(n) is the product of the distinct prime divisors of nn (the largest squarefree divisor). The abcabc conjecture of Masser and Oesterlé asserts that for each ε>0\varepsilon>0 there is Kε>0K_\varepsilon>0 such that every triple of coprime positive integers with a+b=ca+b=c satisfies c≤Kεrad⁡(abc)1+εc\le K_\varepsilon\operatorname{rad}(abc)^{1+\varepsilon}; equivalently log⁡c≪εlog⁡rad⁡(abc)\log c\ll_\varepsilon\log\operatorname{rad}(abc) up to ε\varepsilon. Unconditionally, all known bounds without size restrictions are of exponential type, log⁡c≤Kεrad⁡(abc)α+ε\log c\le K_\varepsilon\operatorname{rad}(abc)^{\alpha+\varepsilon}, the sharpest being α=1/3\alpha=1/3 due to Stewart and Yu via the theory of linear forms in logarithms (explicit lower bounds, due to Matveev and others, for non-vanishing determinants of logarithms of algebraic numbers). Under the size restriction a≤c1−ηa\le c^{1-\eta}, Pasten later proved a subexponential bound of square-root shape, a substantial improvement of an earlier subexponential bound of his: there is an absolute κ>0\kappa>0 with

log⁡c≤η−1exp⁡ ⁣(κ(log⁡rad⁡(abc))log⁡2∗rad⁡(abc)),\log c\le\eta^{-1}\exp\!\left(\kappa\sqrt{(\log\operatorname{rad}(abc))\log_2^*\operatorname{rad}(abc)}\right),

where log⁡k\log_k denotes the kk-fold iterated logarithm and log⁡k∗(t)=log⁡k(t)\log_k^*(t)=\log_k(t) unless this is less than 11 or undefined, in which case it is set to 11. This result combines linear forms in logarithms with a modular approach based on Shimura curves (curves obtained as quotients of the upper half-plane by orders in quaternion algebras, realizable as moduli of abelian surfaces), which relates the abcabc-quality of a triple to heights of points on such curves.

Pasten and Sepúlveda-Manzo (2024; published 2025) revisited these estimates and proved a variation whose key feature is that the radical of aa does not appear: if a+b=ca+b=c with a≤c/exp⁡((log⁡c)τlog⁡2∗c)a\le c/\exp((\log c)^\tau\log_2^*c) for some τ>0\tau>0, then

log⁡c≤exp⁡ ⁣(τ−1κ⋅log⁡3∗rad⁡(bc)log⁡2∗rad⁡(bc)⋅log⁡rad⁡(bc)).\log c\le\exp\!\left(\tau^{-1}\kappa\cdot\frac{\log_3^*\operatorname{rad}(bc)}{\log_2^*\operatorname{rad}(bc)}\cdot\log\operatorname{rad}(bc)\right).

This is subexponential in rad⁡(bc)\operatorname{rad}(bc) (the exponent of log⁡c\log c is o(log⁡rad⁡(bc))o(\log\operatorname{rad}(bc))) but still of exponential shape in log⁡rad⁡(bc)\log\operatorname{rad}(bc), in contrast to the square-root shape above. The authors state that improving it to the square-root shape with rad⁡(bc)\operatorname{rad}(bc) in place of rad⁡(abc)\operatorname{rad}(abc) "at present seems difficult", because the proof of the rad⁡(abc)\operatorname{rad}(abc)-bound crucially uses estimates from the Shimura-curve approach that depend on the full radical rad⁡(abc)\operatorname{rad}(abc).

The motivation is the multi-term generalization. Browkin and Brzeziński proposed the nn-conjecture: for fixed n≥3n\ge3 there is MnM_n such that every zero-sum x1+⋯+xn=0x_1+\cdots+x_n=0 of integers with gcd⁡(x1,…,xn)=1\gcd(x_1,\dots,x_n)=1 and no vanishing proper subsum satisfies max⁡j∣xj∣≤rad⁡(x1⋯xn)Mn\max_j|x_j|\le\operatorname{rad}(x_1\cdots x_n)^{M_n}; a strong variant discussed in Browkin's survey replaces the conditions by pairwise coprimality of the xjx_j. The polynomial analogues (function-field versions, via the Mason–Stothers theorem — the polynomial analogue of the abcabc inequality, asserting that for coprime polynomials with f+g=hf+g=h the degree of hh is bounded by the number of distinct roots of fghfgh — and its extensions) are known, but over Z\mathbb{Z} the authors state they are "not aware of any unconditional result (not even exponential!)" for these conjectures for any n≥4n\ge4. The case n=4n=4 is usually called the abcdabcd conjecture. Applying their rad⁡(bc)\operatorname{rad}(bc)-bound, Pasten and Sepúlveda-Manzo proved the first unconditional estimate for n=4n=4: if some pairwise subsum satisfies min⁡i<j∣xi+xj∣≤H/exp⁡((log⁡H)τlog⁡2∗H)\min_{i<j}|x_i+x_j|\le H/\exp((\log H)^\tau\log_2^*H), where H=max⁡j∣xj∣H=\max_j|x_j|, then log⁡H≤exp⁡(τ−1κ(log⁡3∗R/log⁡2∗R)log⁡R)\log H\le\exp(\tau^{-1}\kappa(\log_3^*R/\log_2^*R)\log R) with R=rad⁡(x1x2x3x4)R=\operatorname{rad}(x_1x_2x_3x_4); equivalently log⁡H≪εRε\log H\ll_\varepsilon R^\varepsilon for every ε>0\varepsilon>0. The auxiliary hypothesis that some subsum of two terms is small is essential to their argument, since it reduces the four-term equation to a three-term one to which the rad⁡(bc)\operatorname{rad}(bc)-bound applies.

Problem Statement

The overarching objective is unconditional, quantitative, radical-based control of multi-term additive relations over Z\mathbb{Z}, in the generality of the Browkin–Brzeziński nn-conjectures, with n=4n=4 as the first open case. The target is the following, with an explicit (effective) bound:

(Removal of the size hypothesis.) Prove that there is an explicit function FF such that every quadruple of pairwise coprime non-zero integers x1,x2,x3,x4x_1,x_2,x_3,x_4 with x1+x2+x3+x4=0x_1+x_2+x_3+x_4=0 satisfies H=max⁡j∣xj∣≤F(rad⁡(x1x2x3x4))H=\max_j|x_j|\le F(\operatorname{rad}(x_1x_2x_3x_4)), with no hypothesis on the size of any subsum. The desired shape is subexponential, e.g. log⁡H≤exp⁡(o(log⁡R))\log H\le\exp(o(\log R)) as R→∞R\to\infty with R=rad⁡(x1x2x3x4)R=\operatorname{rad}(x_1x_2x_3x_4) (this shape is a desideratum, not a requirement), matching the quality of the known bound of Pasten–Sepúlveda-Manzo that currently requires min⁡i<j∣xi+xj∣≤H/exp⁡((log⁡H)τlog⁡2∗H)\min_{i<j}|x_i+x_j|\le H/\exp((\log H)^\tau\log_2^*H); however, since no unconditional bound of any shape is currently known for n≥4n\ge4 without such a hypothesis, any explicit unconditional FF resolves the main gap. The same question, with nn terms in place of 44 for general n≥4n\ge4 and the corresponding gcd/no-vanishing-subsum hypotheses of the nn-conjecture, is the natural general form; a bound for n=4n=4 alone resolves the source question.

The sought bound is unconditional: it must not rely on the abcabc or abcdabcd conjectures, on Szpiro's conjecture, or on other unproved conjectural inputs. The strong 4-term inequality H≤RM4H\le R^{M_4} for some constant M4M_4, and the corresponding nn-term inequality, are stronger statements than the bound sought here.

Source-raised related intermediate. The source authors ask whether their rad⁡(bc)\operatorname{rad}(bc)-only bound for a+b=ca+b=c under a≤c/exp⁡((log⁡c)τlog⁡2∗c)a\le c/\exp((\log c)^\tau\log_2^*c), namely the exponential-shape bound log⁡c≤exp⁡(τ−1κ(log⁡3∗rad⁡(bc)/log⁡2∗rad⁡(bc))log⁡rad⁡(bc))\log c\le\exp(\tau^{-1}\kappa(\log_3^*\operatorname{rad}(bc)/\log_2^*\operatorname{rad}(bc))\log\operatorname{rad}(bc)), can be improved to "something similar to" the square-root-shaped rad⁡(abc)\operatorname{rad}(abc)-bound log⁡c≤η−1exp⁡(κ(log⁡rad⁡(abc))log⁡2∗rad⁡(abc))\log c\le\eta^{-1}\exp(\kappa\sqrt{(\log\operatorname{rad}(abc))\log_2^*\operatorname{rad}(abc)}), and state that this "at present seems difficult", because the Shimura-curve estimates feeding the square-root bound depend on the full radical rad⁡(abc)\operatorname{rad}(abc); any such improvement must avoid dependence on rad⁡(a)\operatorname{rad}(a). The source does not fix the exact placement of the τ\tau-dependence or the constant structure in such an improvement. This intermediate concerns three-term equations and retains a size hypothesis on aa; it may be posed with that hypothesis kept, weakened, or removed, and it leaves the subsum hypothesis of the four-term bound in place.

References

  1. H. Pasten, R. Sepúlveda-Manzo, "On the abcabc and the abcdabcd conjectures", arXiv:2406.05083 (2024); published as "On the abc and the abcd Conjectures", Bulletin of the Brazilian Mathematical Society, New Series 56 (2025), no. 4, DOI 10.1007/s00574-025-00476-1, https://arxiv.org/abs/2406.05083
  2. J. Browkin, J. Brzeziński, "Some remarks on the abcabc-conjecture", Mathematics of Computation 62 (1994), no. 206, 931–939, DOI 10.2307/2153551, https://doi.org/10.2307/2153551
  3. J. Browkin, "The abcabc-conjecture", in: Number theory (R. P. Bambah, V. C. Dumir, R. J. Hans-Gill, eds.), Trends in Mathematics, Birkhäuser, Basel, 2000, pp. 75–105, DOI 10.1007/978-3-0348-7023-8_5, https://doi.org/10.1007/978-3-0348-7023-8_5 (zbMATH Zbl 0971.11010)
  4. H. Pasten, "The largest prime factor of n2+1n^2+1 and improvements on subexponential ABCABC", Inventiones mathematicae 236 (2024), no. 1, 373–385, DOI 10.1007/s00222-024-01244-6, https://doi.org/10.1007/s00222-024-01244-6
  5. H. Pasten, "Shimura curves and the abcabc conjecture", Journal of Number Theory 254 (2024), 214–335, DOI 10.1016/j.jnt.2023.07.002, https://doi.org/10.1016/j.jnt.2023.07.002
  6. C. L. Stewart, K. Yu, "On the abc conjecture, II", Duke Mathematical Journal 108 (2001), no. 1, 169–181, DOI 10.1215/s0012-7094-01-10815-6, https://doi.org/10.1215/s0012-7094-01-10815-6
  7. P. Vojta, "A more general abcabc conjecture", International Mathematics Research Notices 1998, no. 21, 1103–1116, DOI 10.1155/S1073792898000658, https://doi.org/10.1155/S1073792898000658
  8. F. Luca, I. Pink, C. Sándor, "On the largest value of the solutions of Erdős' last equation", International Journal of Number Theory 21 (2025), no. 6, 1281–1295, DOI 10.1142/s1793042125500666, https://doi.org/10.1142/s1793042125500666
  9. J. Cuevas Barrientos, H. Pasten, "On the greatest prime factor of polynomial values and subexponential Szpiro in families", arXiv:2504.15971 (2025), https://arxiv.org/abs/2504.15971
  10. H. Pasten, "Power-saving bounds for Thue–Mahler and Mordell equations", arXiv:2608.23559 (2026), https://arxiv.org/abs/2608.23559
  11. R. Zhang, "The abcdabcd conjecture, uniform boundedness, and dynamical systems", arXiv:2206.09725 (2022, revised 2024), https://arxiv.org/abs/2206.09725
  12. J. D. Lichtman, "The abcabc Conjecture is True Almost Always", The American Mathematical Monthly (2026), DOI 10.1080/00029890.2026.2702867, https://doi.org/10.1080/00029890.2026.2702867