Contents

Improving the Stewart–Yu bound for all abc triples

Ruiyi Zhang Independent Researcher, Columbia, Maryland, USA
(Date: November 13, 2026)
Abstract.

We prove that log⁡c<A⁢R1/3⁢exp⁡(−log⁡R/(3000⁢log⁡log⁡R))\log c<AR^{1/3}\exp(-\log R/(3000\log\log R)) for coprime positive integers a+b=ca+b=c, where R=rad⁡(a⁢b⁢c)R=\operatorname{rad}(abc) and AA is absolute and effectively computable. The proof combines estimates at maximal prime powers with a growing number of auxiliary primes in a rational logarithmic form.

Key words and phrases:
abc conjecture, radical, effective bounds, pp-adic logarithmic forms
2020 Mathematics Subject Classification:
Primary 11D75; Secondary 11J86, 11D61

1. Introduction

For positive coprime integers a+b=ca+b=c, put R=rad⁡(a⁢b⁢c)R=\operatorname{rad}(abc). The a⁢b⁢cabc conjecture predicts c<Kε⁢R1+εc<K_{\varepsilon}R^{1+\varepsilon} for every ε>0\varepsilon>0. It remains open. Stewart–Yu [5, p. 226] proved log⁡c<R2/3+C/log⁡log⁡R\log c<R^{2/3+C/\log\log R} for c>2c>2. Their later bound [6, Theorem 1, p. 170] is log⁡c≪R1/3⁢(log⁡R)3\log c\ll R^{1/3}(\log R)^{3}, effectively. We prove the following.

Theorem 1.

There is an absolute effectively computable A>0A>0 such that

(1.1) log⁡c<A⁢R1/3⁢exp⁡(−log⁡R3000⁢log⁡log⁡R)\log c<AR^{1/3}\exp\!\left(-\frac{\log R}{3000\log\log R}\right)

for all positive integers a+b=ca+b=c with gcd⁡(a,b)=1\gcd(a,b)=1.

Equivalently, log⁡c<A⁢R1/3−1/(3000⁢log⁡log⁡R)\log c<AR^{1/3-1/(3000\log\log R)}, where the exponent tends to 1/31/3 from below as R→∞R\to\infty. Except for (1,1,2)(1,1,2), one has R≥6R\geq 6 and log⁡log⁡R>0\log\log R>0. In particular, log⁡c≪R1/3\log c\ll R^{1/3} effectively. For R≥6R\geq 6, Pasten [3, Theorem 1.4] bounds log⁡c\log c by Pmin⁢exp⁡(κP⁢log⁡R⁢log⁡log⁡R)P_{\min}\exp(\kappa_{\rm P}\sqrt{\log R\log\log R}). Here Pmin=min⁡{P⁢(a),P⁢(b),P⁢(c)}P_{\min}=\min\{P(a),P(b),P(c)\}, P⁢(n)P(n) is the largest prime factor and P⁢(1)=1P(1)=1. For a≤c1−ϑa\leq c^{1-\vartheta} and fixed ϑ>0\vartheta>0, he bounds it by ϑ−1⁢exp⁡(κP⁢log⁡R⁢log⁡log⁡R)\vartheta^{-1}\exp(\kappa_{\rm P}\sqrt{\log R\log\log R}), with an absolute κP>0\kappa_{\rm P}>0. These improve the bound in restricted regions. Neither displayed estimate gives an improvement over the Stewart–Yu bound log⁡c≪R1/3⁢(log⁡R)3\log c\ll R^{1/3}(\log R)^{3} for all triples in terms of RR alone.

Put

(1.2) H=log⁡c,W=log⁡R,L=1+W,X=R1/3.H=\log c,\qquad W=\log R,\qquad L=1+W,\qquad X=R^{1/3}.

Let Mi,si,ΔM_{i},s_{i},\Delta be as in Section 3. Let CTC_{T} be the effective constant in (3.5) and put CP=100000⁢CVC_{P}=100000C_{V}, with CVC_{V} defined in (4.1). On 𝒩\mathcal{N} in (3.1), we use

(1.3) H<CT⁢X⁢L2⁢Δ−2/9,H<CP⁢X⁢L10⁢exp⁡(−W156⁢log⁡W+113⁢log⁡Δ).H<C_{T}XL^{2}\Delta^{-2/9},\qquad H<C_{P}XL^{10}\exp\!\left(-\frac{W}{156\log W% }+\frac{11}{3}\log\Delta\right).

The second holds for W≥W0W\geq W_{0} when log⁡Δ≤(3/1820)⁢W/log⁡W\log\Delta\leq(3/1820)W/\log W. At this boundary both rates equal 1/2730>1/30001/2730>1/3000. Section 6 gives an effective common threshold. Stewart [4, Section 4, (4.13)–(4.14)] introduced the growing auxiliary-prime construction. Section 4 bounds the cofactors uiu_{i} used in applying this construction to additive triples. For earlier pp-adic estimates, see [7]. The use of AI tools is described at the end of the paper.

2. Known estimates

All logarithms are natural. Write ω⁢(n)\omega(n) for the number of distinct prime divisors of nn, with ω⁢(1)=0\omega(1)=0, and π⁢(x)\pi(x) for the number of primes at most xx. For reduced x/yx/y, put h⁢(x/y)=log⁡max⁡(|x|,|y|)h(x/y)=\log\max(|x|,|y|). Write T⁢(z)=max⁡(1,h⁢(z))T(z)=\max(1,h(z)) for rational zz. The valuation satisfies vp⁢(p)=1v_{p}(p)=1 and |x|p=p−vp⁢(x)|x|_{p}=p^{-v_{p}(x)}.

Fact F1 ([6, Theorem 1, p. 170, (5)]).

There is an absolute effectively computable S≥1S\geq 1 such that

(2.1) H≤S⁢X⁢W3.H\leq SXW^{3}.
Fact F2 ([6, Lemma 2, p. 173, and (10), p. 172]).

For rational pp-units α1,…,αn\alpha_{1},\ldots,\alpha_{n}, integer exponents |bi|≤B0|b_{i}|\leq B_{0}, B0≥3B_{0}\geq 3, and Θ=∏iαibi−1≠0\Theta=\prod_{i}\alpha_{i}^{b_{i}}-1\neq 0,

(2.2) vp⁢(Θ)<plog⁡p⁢(c9⁢n)2⁢n⁢∏imax⁡(h⁢(αi),log⁡p)log⁡p⁢log⁡B0,v_{p}(\Theta)<\frac{p}{\log p}(c_{9}n)^{2n}\prod_{i}\frac{\max(h(\alpha_{i}),% \log p)}{\log p}\log B_{0},

where c9>0c_{9}>0 is absolute and effectively computable.

In K=ℚ⁢(α0)K=\mathbb{Q}(\alpha_{0}) of [6, Section 2, (10)], the ramification index at pp is 11, including p=2p=2; hence ord𝔭\operatorname{ord}_{\mathfrak{p}} on ℚ\mathbb{Q} agrees with vpv_{p}. Independence is not required, and a base −1-1 is allowed.

Fact F3 ([1, Proposition 5, p. 517], corrected in [2]).

Put K0=300⁢(16⁢e)8K_{0}=300(16e)^{8}. Let m≥1m\geq 1 and let Γ\Gamma be generated by distinct primes q1,…,qmq_{1},\ldots,q_{m} and −1-1. The primes form a basis for Γ/Γtors\Gamma/\Gamma_{\rm tors}. If ξ∈Γ\xi\in\Gamma and ξ≠1,−1\xi\neq 1,-1, then

(2.3) −log⁡|1−ξ|\displaystyle-\log|1-\xi| <K0m⁢log⁡max⁡(e,h⁢(ξ))⁢∏jlog⁡qj,\displaystyle<K_{0}^{m}\log\max(e,h(\xi))\prod_{j}\log q_{j},
(2.4) −log⁡|1−ξ|p\displaystyle-\log|1-\xi|_{p} <K0m⁢plog⁡p⁢log⁡max⁡(e,p⁢h⁢(ξ))⁢∏jlog⁡qj.\displaystyle<K_{0}^{m}\frac{p}{\log p}\log\max(e,ph(\xi))\prod_{j}\log q_{j}.
Lemma 2.1 (Specialisation of the group estimate).

Proposition 5 of [1], with the sign corrected in [2], gives (2.3)–(2.4) under the hypotheses of Fact F3.

Proof.

Apply Proposition 5 of [1], with the sign corrected in [2], with K=ℚK=\mathbb{Q} and the parameter α=1\alpha=1 in [1]. The group has positive rank, and h⁢(ξ)≥log⁡2>0h(\xi)\geq\log 2>0. Its constant is 48⁢(16⁢e)848(16e)^{8} for m=1m=1. For m≥2m\geq 2, the specialized coefficient 2⁢(m+1)⁢log⁡max⁡(e,m)⁢(16⁢e)3⁢m+52(m+1)\log\max(e,m)(16e)^{3m+5} is at most 4m⁢(16⁢e)8⁢m≤(8⁢(16⁢e)8)m4^{m}(16e)^{8m}\leq\bigl{(}8(16e)^{8}\bigr{)}^{m}, since m+1≤2mm+1\leq 2^{m}, log⁡max⁡(e,m)≤2m−1\log\max(e,m)\leq 2^{m-1} and 3⁢m+5≤8⁢m3m+5\leq 8m. The factor for the real place is at most F=4/log⁡2>1F=4/\log 2>1. For m≥2m\geq 2, F⁢(8⁢(16⁢e)8)m≤((32/log⁡2)⁢(16⁢e)8)m<K0mF\bigl{(}8(16e)^{8}\bigr{)}^{m}\leq\bigl{(}(32/\log 2)(16e)^{8}\bigr{)}^{m}<K_% {0}^{m}. For m=1m=1, 48⁢F<30048F<300; both comparisons follow from log⁡2>2/3\log 2>2/3. ∎

Fact F4 ([4, Lemma 3.1, pp. 301–302]; [8, Main theorem, (1.18), p. 321]).

Let p≥5p\geq 5, n≥7n\geq 7, and ℓ=log⁡p\ell=\log p. For independent rational pp-units αi\alpha_{i} and integers bib_{i}, not all zero, put Be=max⁡(2,|b1|,…,|bn|)B_{e}=\max(2,|b_{1}|,\ldots,|b_{n}|). If ∏iαibi≠1\prod_{i}\alpha_{i}^{b_{i}}\neq 1, then

(2.5) vp⁢(∏iαibi−1)< 376⁢n+1⁢[4+log⁡(n+1)]⁢(7⁢e⁢p−1p−2)n⁢∏ih⁢(αi)⋅max⁡(p⁢(n/ℓ)n,en⁢ℓ)⁢max⁡(log⁡Be,5.4⁢n⁢(n+1)).\begin{split}v_{p}\left(\prod_{i}\alpha_{i}^{b_{i}}-1\right)<&\ 376\sqrt{n+1}% \,[4+\log(n+1)]\left(7e\frac{p-1}{p-2}\right)^{n}\prod_{i}h(\alpha_{i})\\ &\cdot\max\left(p(n/\ell)^{n},e^{n}\ell\right)\max\bigl{(}\log B_{e},5.4n(n+1)% \bigr{)}.\end{split}
Lemma 2.2 (Specialisation of the growing-rank estimate).

Under the hypotheses of Fact F4, estimate (2.5) follows from its cited sources.

Proof.

Stewart’s derivation uses the constants 17941794 and 5.255.25. Yu’s published rational case has 17901790 and 5.845.84; with these constants, the bound G1≤5.4⁢n⁢(n+1)G_{1}\leq 5.4n(n+1) used here holds for n≥7n\geq 7. We derive this range directly from Yu [8]. Use [8, (1.9), (1.11), (1.13), (1.28), (1.30)–(1.31)] with d=f=e𝔭=1d=f=e_{\mathfrak{p}}=1 and Yu’s parameters qY=2q_{\rm Y}=2, qYuY=2q_{\rm Y}^{u_{\rm Y}}=2. Relabel a minimum-valuation exponent last, as (1.17) requires. We retain 5.845.84 throughout and use the upper bound 1790≤17941790\leq 1794. Put Qn=4+log⁡(n+1)Q_{n}=4+\log(n+1) and Me=max⁡(log⁡Be,5.4⁢n⁢(n+1))M_{e}=\max(\log B_{e},5.4n(n+1)). Then

G1n+1<4⁢n+6+log⁡(4⁢n+6)≤5.4⁢n(n≥7).\frac{G_{1}}{n+1}<4n+6+\log(4n+6)\leq 5.4n\quad(n\geq 7).

The last inequality holds at 77, and its difference increases. Since h⁢(αi)≥log⁡2h(\alpha_{i})\geq\log 2 and the auxiliary quantity in [8, (1.15)] equals log⁡2⁢log⁡3/log⁡6\log 2\log 3/\log 6, the first term of h(1)h^{(1)} is at most

log⁡Be+log⁡(2⁢log⁡3/log⁡6)<log⁡Be+14<1.001⁢Me.\log B_{e}+\log(2\log 3/\log 6)<\log B_{e}+\tfrac{1}{4}<1.001M_{e}.

Yu’s additional term log⁡B∘\log B^{\circ}, where B∘=min⁡{|bi|:bi≠0}B^{\circ}=\min\{|b_{i}|:b_{i}\neq 0\}, satisfies log⁡B∘≤log⁡Be≤Me\log B^{\circ}\leq\log B_{e}\leq M_{e}. Hence h(1)≤max⁡(1.001⁢Me,(n+1)⁢ℓ)h^{(1)}\leq\max(1.001M_{e},(n+1)\ell). The saturated residue-group index δ⁢(𝜶)\delta(\boldsymbol{\alpha}) is at least 11. Yu’s main theorem uses the heights of the original independent tuple in both Kummer cases; we only enlarge p/δ⁢(𝜶)p/\delta(\boldsymbol{\alpha}) to pp. Yu’s first bound is consequently at most

1794⁢(7⁢p−1p−2)n⁢(n+1)n+12⁢n!⁢ℓ2⁢∏ih⁢(αi)⋅max⁡(p⁢(n/ℓ)n,en⁢ℓ)⁢max⁡(Qn,ℓ)⁢max⁡(1.001⁢Me,(n+1)⁢ℓ).\begin{split}&1794\left(7\frac{p-1}{p-2}\right)^{n}\frac{(n+1)^{n+1}}{2n!\ell^% {2}}\prod_{i}h(\alpha_{i})\\ &\quad\cdot\max\left(p(n/\ell)^{n},e^{n}\ell\right)\max(Q_{n},\ell)\max(1.001M% _{e},(n+1)\ell).\end{split}

Use Stirling’s inequality (n+1)n+1/n!≤en+1⁢n+1/2⁢π(n+1)^{n+1}/n!\leq e^{n+1}\sqrt{n+1}/\sqrt{2\pi}. Also max⁡(Qn,ℓ)/ℓ≤Qn/log⁡5\max(Q_{n},\ell)/\ell\leq Q_{n}/\log 5 and max⁡(1.001⁢Me,(n+1)⁢ℓ)/ℓ≤1.001⁢Me/log⁡5\max(1.001M_{e},(n+1)\ell)/\ell\leq 1.001M_{e}/\log 5. Finally,

1.001⋅1794⁢e2⁢2⁢π⁢(log⁡5)2<376.\frac{1.001\cdot 1794e}{2\sqrt{2\pi}(\log 5)^{2}}<376.

For this comparison one may use e<2.718282e<2.718282, log⁡5>1.609437\log 5>1.609437, and 2⁢π>2.50662\sqrt{2\pi}>2.50662. This gives (2.5) from the published constants for n≥7n\geq 7. ∎

Put CH=6+log⁡SC_{H}=6+\log S. By (2.1), if h⁢(ξ)≤Hh(\xi)\leq H and 1≤y≤R1\leq y\leq R, then

(2.6) log⁡max⁡(e,y⁢h⁢(ξ))≤CH⁢L,\log\max(e,yh(\xi))\leq C_{H}L,

since log⁡(R⁢H)≤log⁡S+4⁢W/3+3⁢log⁡W≤CH⁢L\log(RH)\leq\log S+4W/3+3\log W\leq C_{H}L and CH⁢L≥6C_{H}L\geq 6. For fixed γ>0\gamma>0, define the effective constants

(2.7) Uγ=⌈max⁡(1,4/γ2,2⁢log⁡K0/γ)⌉,Cγ=∏q<eUγq⁢primemax⁡(1,K0⁢max⁡(1,log⁡q)qγ).\begin{split}U_{\gamma}&=\left\lceil\max(1,4/\gamma^{2},2\log K_{0}/\gamma)% \right\rceil,\\ C_{\gamma}&=\prod_{\begin{subarray}{c}q<e^{U_{\gamma}}\\ q\ \mathrm{prime}\end{subarray}}\max\left(1,\frac{K_{0}\max(1,\log q)}{q^{% \gamma}}\right).\end{split}

For every squarefree JJ,

(2.8) G⁢(J):=K0ω⁢(J)⁢∏q∣Jlog⁡q≤Cγ⁢Jγ,G⁢(1)=1.G(J):=K_{0}^{\omega(J)}\prod_{q\mid J}\log q\leq C_{\gamma}J^{\gamma},\qquad G% (1)=1.

For ζ=log⁡q≥Uγ\zeta=\log q\geq U_{\gamma}, log⁡K0≤γ⁢ζ/2\log K_{0}\leq\gamma\zeta/2 and log⁡ζ≤ζ≤γ⁢ζ/2\log\zeta\leq\sqrt{\zeta}\leq\gamma\zeta/2. Multiply over the primes dividing JJ.

3. Maximal prime powers

Arrange a≤ba\leq b. For each nonunit side i∈{a,b,c}i\in\{a,b,c\}, put

Mi=maxq∣i⁡vq⁢(i),si=min⁡{q:vq⁢(i)=Mi},ui=i/siMi,Ei=rad⁡(ui).M_{i}=\max_{q\mid i}v_{q}(i),\qquad s_{i}=\min\{q:v_{q}(i)=M_{i}\},\qquad u_{i% }=i/s_{i}^{M_{i}},\qquad E_{i}=\operatorname{rad}(u_{i}).

By definition, si∤uis_{i}\nmid u_{i}. On a2>ca^{2}>c, all three sides exceed c\sqrt{c}. Put

xi=log⁡si,Hi=Mi⁢xi,Δ=Ea⁢Eb⁢Ec,Ji=Δ/Ei,Ω=log⁡Δ.x_{i}=\log s_{i},\quad H_{i}=M_{i}x_{i},\quad\Delta=E_{a}E_{b}E_{c},\quad J_{i% }=\Delta/E_{i},\quad\Omega=\log\Delta.

Consider the range

(3.1) 𝒩={a2>c,si39>R10⁢ for every ⁢i}.\mathcal{N}=\{a^{2}>c,\ s_{i}^{39}>R^{10}\text{ for every }i\}.

On this range,

(3.2) R=sa⁢sb⁢sc⁢Δ,Ja⁢Jb⁢Jc=Δ2,\displaystyle R=s_{a}s_{b}s_{c}\Delta,\qquad J_{a}J_{b}J_{c}=\Delta^{2},
(3.3) 1039⁢W<xi<1939⁢W,Ω<939⁢W<xi,log⁡rad⁡(i)<1939⁢W,Hi>519⁢H.\displaystyle\frac{10}{39}W<x_{i}<\frac{19}{39}W,\quad\Omega<\frac{9}{39}W<x_{% i},\quad\log\operatorname{rad}(i)<\frac{19}{39}W,\quad H_{i}>\frac{5}{19}H.

We have xi≤W−xj−xk<19⁢W/39x_{i}\leq W-x_{j}-x_{k}<19W/39 and log⁡rad⁡(i)≤W−xj−xk\log\operatorname{rad}(i)\leq W-x_{j}-x_{k}; summing the three lower bounds gives Ω=W−xa−xb−xc<9⁢W/39\Omega=W-x_{a}-x_{b}-x_{c}<9W/39. Maximality gives Hi≥xi⁢log⁡i/log⁡rad⁡(i)>(10/19)⁢log⁡i>5⁢H/19H_{i}\geq x_{i}\log i/\log\operatorname{rad}(i)>(10/19)\log i>5H/19. Also R≥30R\geq 30, W>3W>3 and W>3⁢L/4W>3L/4. The actual ratios

(3.4) ξa=b/c,ξb=a/c,ξc=−a/b\xi_{a}=b/c,\qquad\xi_{b}=a/c,\qquad\xi_{c}=-a/b

have height at most HH and satisfy vq⁢(1−ξi)=vq⁢(i)v_{q}(1-\xi_{i})=v_{q}(i) for q∣iq\mid i.

Set

(3.5) CU=2⁢CH⁢C1/6,CS=2⁢CH⁢K02⁢C1/26(log⁡2)2,CT=74150⁢CH⁢K02⁢C1/6.C_{U}=2C_{H}C_{1/6},\qquad C_{S}=\frac{2C_{H}K_{0}^{2}C_{1/26}}{(\log 2)^{2}},% \qquad C_{T}=\frac{741}{50}C_{H}K_{0}^{2}C_{1/6}.

If a2≤ca^{2}\leq c, apply (F3) at infinity to ξ=b/c\xi=b/c. Here −log⁡(1−ξ)≥H/2-\log(1-\xi)\geq H/2. Equations (2.6)–(2.8) give

(3.6) H<CU⁢X⁢L⁢e−W/6.H<C_{U}XLe^{-W/6}.

This includes unit sides and a2=ca^{2}=c. If a2>ca^{2}>c and some si39≤R10s_{i}^{39}\leq R^{10}, choose p=si=min⁡{sa,sb,sc}p=s_{i}=\min\{s_{a},s_{b},s_{c}\}; then p39≤R10p^{39}\leq R^{10}. Since log⁡i≤Mi⁢log⁡rad⁡(i)≤Mi⁢W\log i\leq M_{i}\log\operatorname{rad}(i)\leq M_{i}W and log⁡i>H/2\log i>H/2, maximality gives H<2⁢W⁢Hi/log⁡pH<2WH_{i}/\log p. Apply (F3) to the full off-side prime basis in (3.4):

Hi<CH⁢K02⁢C1/26⁢plog⁡p⁢L⁢xj⁢xk⁢Ji1/26≤CH⁢K02⁢C1/26⁢plog⁡p⁢L3⁢R1/26.H_{i}<C_{H}K_{0}^{2}C_{1/26}\frac{p}{\log p}Lx_{j}x_{k}J_{i}^{1/26}\leq C_{H}K% _{0}^{2}C_{1/26}\frac{p}{\log p}L^{3}R^{1/26}.

Since p≤R10/39=X⁢R−1/13p\leq R^{10/39}=XR^{-1/13},

(3.7) H<CS⁢X⁢L4⁢e−W/26.H<C_{S}XL^{4}e^{-W/26}.

On all of 𝒩\mathcal{N}, (F3) together with (2.8), with γ=1/6\gamma=1/6, gives

xj⁢xkxi≤3910⁢W,C∗=3910⁢CH⁢K02⁢C1/6,Hi<CH⁢K02⁢C1/6⁢L⁢sixi⁢xj⁢xk⁢Ji1/6<C∗⁢si⁢L2⁢Ji1/6.\begin{gathered}\frac{x_{j}x_{k}}{x_{i}}\leq\frac{39}{10}W,\qquad C_{*}=\frac{% 39}{10}C_{H}K_{0}^{2}C_{1/6},\\ H_{i}<C_{H}K_{0}^{2}C_{1/6}L\frac{s_{i}}{x_{i}}x_{j}x_{k}J_{i}^{1/6}<C_{*}s_{i% }L^{2}J_{i}^{1/6}.\end{gathered}

Multiply and use (3.2)–(3.3):

(3.8) ∏iHi<C∗3⁢R⁢L6⁢Δ−2/3,H<CT⁢X⁢L2⁢Δ−2/9.\prod_{i}H_{i}<C_{*}^{3}RL^{6}\Delta^{-2/3},\qquad H<C_{T}XL^{2}\Delta^{-2/9}.

There is no restriction on Δ\Delta in this estimate.

4. Cofactors of the maximal prime powers

Assume the triple lies in 𝒩\mathcal{N}. Put κ=max⁡(1,c9)\kappa=\max(1,c_{9}) and F⁢(n)=(κ⁢n)2⁢nF(n)=(\kappa n)^{2n}. Choose an integer m0≥7m_{0}\geq 7 with log⁡(m0+1)≥8⁢log⁡κ+10\log(m_{0}+1)\geq 8\log\kappa+10. Define

(4.1) CF=max⁡(1,max0≤m<m0⁡F⁢(m+3)((m+1)!)3),CV=(CH+2)⁢CF4⁢(log⁡2)3.C_{F}=\max\left(1,\max_{0\leq m<m_{0}}\frac{F(m+3)}{((m+1)!)^{3}}\right),% \qquad C_{V}=\frac{(C_{H}+2)C_{F}}{4(\log 2)^{3}}.

Then CV≥1C_{V}\geq 1, since CF≥F⁢(3)≥729C_{F}\geq F(3)\geq 729. For squarefree JJ with m=ω⁢(J)m=\omega(J), one has J≥(m+1)!J\geq(m+1)!. Integration gives log⁡((m+1)!)≥(m+1)⁢log⁡(m+1)−m\log((m+1)!)\geq(m+1)\log(m+1)-m. It follows that

log⁡F⁢(m+3)((m+1)!)3≤(3−m)⁢log⁡(m+1)+2⁢(m+3)⁢log⁡κ+3⁢m+4+8m+1≤m⁢[−12⁢log⁡(m+1)+4⁢log⁡κ+5](m≥7).\begin{split}\log\frac{F(m+3)}{((m+1)!)^{3}}&\leq(3-m)\log(m+1)+2(m+3)\log% \kappa+3m+4+\frac{8}{m+1}\\ &\leq m\left[-\tfrac{1}{2}\log(m+1)+4\log\kappa+5\right]\quad(m\geq 7).\end{split}

The last expression is nonpositive for m≥m0m\geq m_{0}. The finite maximum handles m<m0m<m_{0}, including 0. Consequently,

(4.2) F⁢(3+ω⁢(J))≤CF⁢J3.F(3+\omega(J))\leq C_{F}J^{3}.

Let l∣Eil\mid E_{i}. Represent ξi\xi_{i} using sj,sks_{j},s_{k}, every prime dividing JiJ_{i}, and the sign. These bases are ll-units. Their coefficients are at most B0=max⁡(3,H/log⁡2)B_{0}=\max(3,H/\log 2), with log⁡B0≤(CH+2)⁢L\log B_{0}\leq(C_{H}+2)L. Since log⁡l≤Ω<xj,xk\log l\leq\Omega<x_{j},x_{k}, the two factors for sj,sks_{j},s_{k} in (2.2) have product at most L2/[4⁢(log⁡2)2]L^{2}/[4(\log 2)^{2}]. Each remaining prime contributes

max⁡(1,log⁡q/log⁡l)≤max⁡(1,log⁡q/log⁡2)<q.\max(1,\log q/\log l)\leq\max(1,\log q/\log 2)<q.

The sign contributes 11. Apply (F2), (4.2) and l/log⁡l≤Ei/log⁡2l/\log l\leq E_{i}/\log 2:

(4.3) 1≤vl⁢(i)<CV⁢L3⁢Ei⁢Ji4≤CV⁢L3⁢Δ4.1\leq v_{l}(i)<C_{V}L^{3}E_{i}J_{i}^{4}\leq C_{V}L^{3}\Delta^{4}.

Every residual exponent is included, also at l=2l=2. For distinct sides j,kj,k, this yields

(4.4) T⁢(uj/uk)≤CV⁢L4⁢Δ4.T(u_{j}/u_{k})\leq C_{V}L^{4}\Delta^{4}.

If uj>1u_{j}>1, log⁡uj≤maxl∣uj⁡vl⁢(j)⁢Ω\log u_{j}\leq\max_{l\mid u_{j}}v_{l}(j)\,\Omega and Ω<W<L\Omega<W<L; if uj=1u_{j}=1, log⁡uj=0\log u_{j}=0. Likewise for uku_{k}. Coprimality gives h⁢(uj/uk)=max⁡(log⁡uj,log⁡uk)h(u_{j}/u_{k})=\max(\log u_{j},\log u_{k}); use CV≥1C_{V}\geq 1 for T⁢(uj/uk)T(u_{j}/u_{k}).

5. Auxiliary primes in the local estimate

Lemma 5.1.

Let p,q,rp,q,r be distinct primes, ℓ=log⁡p\ell=\log p, and Λ=log⁡ℓ≥106\Lambda=\log\ell\geq 10^{6}. Suppose ℓ≤log⁡q,log⁡r≤2⁢ℓ\ell\leq\log q,\log r\leq 2\ell. Let wq,wrw_{q},w_{r} be coprime positive integers with gcd⁡(wq⁢wr,p⁢q⁢r)=1\gcd(w_{q}w_{r},pqr)=1 and ω⁢(wq⁢wr)≤ℓ\omega(w_{q}w_{r})\leq\ell. For 1≤Nq,Nr≤p21\leq N_{q},N_{r}\leq p^{2}, σ∈{1,−1}\sigma\in\{1,-1\}, and a nonzero difference,

(5.1) vp⁢(wq⁢qNq−σ⁢wr⁢rNr)<25200⁢p⁢ℓ5⁢T⁢(wq/wr)⁢exp⁡(−ℓ52⁢log⁡ℓ).v_{p}(w_{q}q^{N_{q}}-\sigma w_{r}r^{N_{r}})<25200p\ell^{5}T(w_{q}/w_{r})\exp\!% \left(-\frac{\ell}{52\log\ell}\right).
Proof.

Write β\beta for the valuation and z=(wq/wr)⁢qNq⁢r−Nr>0z=(w_{q}/w_{r})q^{N_{q}}r^{-N_{r}}>0. If β=0\beta=0, the result follows. For σ=1\sigma=1, take ν=1\nu=1. For σ=−1\sigma=-1, take ν=2\nu=2; oddness gives vp⁢(z2−1)=vp⁢(z+1)=βv_{p}(z^{2}-1)=v_{p}(z+1)=\beta. Hence β=vp⁢(zν−1)\beta=v_{p}(z^{\nu}-1). The denominator is a pp-unit, and vq⁢(z)=Nq>0v_{q}(z)=N_{q}>0 ensures nonvanishing.

Put n=⌊ℓ/(52⁢Λ)⌋n=\lfloor\ell/(52\Lambda)\rfloor. Then n≥7n\geq 7 and n≥ℓ/(104⁢Λ)n\geq\ell/(104\Lambda). Choose auxiliary primes outside p⁢q⁢r⁢wq⁢wrpqrw_{q}w_{r}. For θ=wq/wr≠1\theta=w_{q}/w_{r}\neq 1, use n−3n-3 of them and set

(5.2) α1\displaystyle\alpha_{1} =q/(ϖ4⁢⋯⁢ϖn),\displaystyle=q/(\varpi_{4}\cdots\varpi_{n}), b1\displaystyle b_{1} =ν⁢Nq,\displaystyle=\nu N_{q},
α2\displaystyle\alpha_{2} =1/r,\displaystyle=1/r, b2\displaystyle b_{2} =ν⁢Nr,\displaystyle=\nu N_{r},
α3\displaystyle\alpha_{3} =θ,\displaystyle=\theta, b3\displaystyle b_{3} =ν,\displaystyle=\nu,
αi\displaystyle\alpha_{i} =ϖi⁢(i≥4),\displaystyle=\varpi_{i}\ (i\geq 4), bi\displaystyle b_{i} =ν⁢Nq.\displaystyle=\nu N_{q}.

If wq=wr=1w_{q}=w_{r}=1, omit θ\theta and use n−2n-2 auxiliaries. The product is zνz^{\nu}. Take an integer relation ∏iαizi=1\prod_{i}\alpha_{i}^{z_{i}}=1. The valuations at qq and rr give z1=z2=0z_{1}=z_{2}=0. For θ≠1\theta\neq 1, a prime in its support then gives z3=0z_{3}=0, and each ϖi\varpi_{i} gives zi=0z_{i}=0 for i≥4i\geq 4. The tuple without θ\theta is treated in the same way. All bases are rational pp-units.

For m=⌊x/2⌋m=\lfloor x/2\rfloor, Legendre’s formula gives

22⁢m2⁢m+1≤(2⁢mm)≤(2⁢m)π⁢(2⁢m).\frac{2^{2m}}{2m+1}\leq\binom{2m}{m}\leq(2m)^{\pi(2m)}.

Each prime contributes at most 2⁢m2m to the binomial coefficient. Hence π⁢(x)⁢log⁡x≥(x−2)⁢log⁡2−log⁡(x+1)\pi(x)\log x\geq(x-2)\log 2-\log(x+1). For x≥1000x\geq 1000, use log⁡2>2/3\log 2>2/3 and x/15≥4/3+log⁡(x+1)x/15\geq 4/3+\log(x+1) to obtain π⁢(x)≥3⁢x/(5⁢log⁡x)\pi(x)\geq 3x/(5\log x). At x=6⁢ℓ⁢log⁡(6⁢ℓ)x=6\ell\log(6\ell),

(5.3) log⁡x≤1.001⁢Λ,π⁢(x)≥36001001⁢ℓ>3⁢ℓ.\log x\leq 1.001\Lambda,\qquad\pi(x)\geq\frac{3600}{1001}\ell>3\ell.

Here log⁡6+log⁡(Λ+log⁡6)≤3+log⁡Λ≤3+Λ/2≤0.001⁢Λ\log 6+\log(\Lambda+\log 6)\leq 3+\log\Lambda\leq 3+\sqrt{\Lambda}/2\leq 0.001\Lambda. There are at most 3+ℓ3+\ell forbidden primes, and n+3<2⁢ℓn+3<2\ell. Therefore h⁢(ϖi)≤1.001⁢Λh(\varpi_{i})\leq 1.001\Lambda is possible.

The auxiliary denominator has logarithm at most 1.001⁢n⁢Λ<ℓ/21.001n\Lambda<\ell/2. Since 1.001⁢Λ≥11.001\Lambda\geq 1, we have (1.001⁢Λ)n−3≤(1.001⁢Λ)n(1.001\Lambda)^{n-3}\leq(1.001\Lambda)^{n}; the same comparison holds for n−2n-2 auxiliaries. Therefore,

(5.4) ∏ih⁢(αi)≤4⁢ℓ2⁢T⁢(wq/wr)⁢(1.001⁢Λ)n,Be≤2⁢p2,\displaystyle\prod_{i}h(\alpha_{i})\leq 4\ell^{2}T(w_{q}/w_{r})(1.001\Lambda)^% {n},\qquad B_{e}\leq 2p^{2},
(5.5) max⁡(log⁡Be,5.4⁢n⁢(n+1))≤3⁢ℓ2.\displaystyle\max(\log B_{e},5.4n(n+1))\leq 3\ell^{2}.

The cofactor-free tuple satisfies the same bounds. Both maximum terms in (F4) are at most p⁢(n/ℓ)np(n/\ell)^{n}, since

log⁡p⁢(n/ℓ)nen⁢ℓ≥ℓ−ℓ52⁢Λ⁢[1+log⁡(104⁢Λ)]−Λ≥0.\log\frac{p(n/\ell)^{n}}{e^{n}\ell}\geq\ell-\frac{\ell}{52\Lambda}[1+\log(104% \Lambda)]-\Lambda\geq 0.

Here [1+log⁡(104⁢Λ)]/(52⁢Λ)<1/2[1+\log(104\Lambda)]/(52\Lambda)<1/2 and ℓ/2>Λ\ell/2>\Lambda. For p≥1000p\geq 1000,

7⁢e2⁢(1.001)⁢(p−1)52⁢(p−2)≤7⁢(68/25)2⁢(1001/1000)⁢(999/998)52<1.\frac{7e^{2}(1.001)(p-1)}{52(p-2)}\leq\frac{7(68/25)^{2}(1001/1000)(999/998)}{% 52}<1.

That upper bound equals 155615229/155937500<0.998155615229/155937500<0.998. Consequently,

(5.6) [7⁢e⁢p−1p−2⁢nℓ⁢(1.001⁢Λ)]n≤e−n≤e⁢exp⁡(−ℓ52⁢Λ).\left[7e\frac{p-1}{p-2}\frac{n}{\ell}(1.001\Lambda)\right]^{n}\leq e^{-n}\leq e% \exp\!\left(-\frac{\ell}{52\Lambda}\right).

Finally, n+1⁢[4+log⁡(n+1)]≤2⁢ℓ\sqrt{n+1}[4+\log(n+1)]\leq 2\ell. Insert (5.4)–(5.6) into (F4), and use 752⁢e⋅4⋅3<25200752e\cdot 4\cdot 3<25200. ∎

6. Proof of Theorem 1

Set

(6.1) τ=31820,η=13000,ρ=12730,μ=ρ−η=391000>140000.\tau=\frac{3}{1820},\quad\eta=\frac{1}{3000},\quad\rho=\frac{1}{2730},\quad\mu% =\rho-\eta=\frac{3}{91000}>\frac{1}{40000}.

Define the effective threshold

(6.2) t0=⌈max⁡(1000002,log⁡(100000⁢CV),log⁡CT,log⁡CU,log⁡CS,log⁡2⁢Slog⁡2)⌉,W0=et0,R0=eW0.\begin{split}t_{0}=\left\lceil\max\left(1000002,\log(100000C_{V}),\log C_{T},% \log C_{U},\log C_{S},\log\frac{2S}{\log 2}\right)\right\rceil,\\ W_{0}=e^{t_{0}},\qquad R_{0}=e^{W_{0}}.\end{split}

Assume W≥W0W\geq W_{0} and put t=log⁡Wt=\log W. Then

(6.3) t≥t0,log⁡L≤t+1,W≥t4,W/t≥t3.t\geq t_{0},\qquad\log L\leq t+1,\qquad W\geq t^{4},\qquad W/t\geq t^{3}.

First suppose the triple lies in 𝒩\mathcal{N} and Ω≤τ⁢W/t\Omega\leq\tau W/t. Choose the least si=ps_{i}=p, with the other primes denoted by q,rq,r. The equation is c−b=ac-b=a, c−a=bc-a=b, or a+b=ca+b=c. The local difference in Lemma 5.1 has valuation β=Mi\beta=M_{i}, with cofactors uj,uku_{j},u_{k} and the appropriate sign. Their supports are coprime and avoid p⁢q⁢rpqr. By (3.3),

(6.4) 10⁢W39<ℓ≤W−Ω3,ℓ≤log⁡q,log⁡r<1910⁢ℓ<2⁢ℓ.\frac{10W}{39}<\ell\leq\frac{W-\Omega}{3},\qquad\ell\leq\log q,\log r<\frac{19% }{10}\ell<2\ell.

In particular, t−2<log⁡ℓ≤tt-2<\log\ell\leq t, so log⁡ℓ≥106\log\ell\geq 10^{6}. The upper bound for ℓ\ell uses p3≤sa⁢sb⁢sc=R/Δp^{3}\leq s_{a}s_{b}s_{c}=R/\Delta, since pp is the least of the three primes. Also

ω⁢(uj⁢uk)≤Ω/log⁡2≤2⁢τ⁢W/t<ℓ.\omega(u_{j}u_{k})\leq\Omega/\log 2\leq 2\tau W/t<\ell.

Every complete exponent is at most (S/log⁡2)⁢eW/3⁢W3(S/\log 2)e^{W/3}W^{3}. Its logarithm is at most W/3+4⁢t<20⁢W/39<2⁢ℓW/3+4t<20W/39<2\ell. The middle comparison follows from 4⁢t<7⁢W/394t<7W/39 in (6.3). Lemma 5.1 applies with exponents at most p2p^{2}. Using (4.4) gives

(6.5) H<195⁢ℓ⁢β<100000⁢CV⁢L10⁢Δ4⁢exp⁡(ℓ−ℓ52⁢log⁡ℓ).H<\frac{19}{5}\ell\beta<100000C_{V}L^{10}\Delta^{4}\exp\!\left(\ell-\frac{\ell% }{52\log\ell}\right).

The function g⁢(x)=x−x/(52⁢log⁡x)g(x)=x-x/(52\log x) increases for log⁡x≥1\log x\geq 1. Put Y=(W−Ω)/3Y=(W-\Omega)/3 and χ=Ω/W\chi=\Omega/W. Since t⁢χ≤τ<log⁡3t\chi\leq\tau<\log 3,

3⁢Y⁢tW−log⁡Y=log⁡3−t⁢χ−log⁡(1−χ)>0,Ylog⁡Y≥W3⁢t.\frac{3Yt}{W}-\log Y=\log 3-t\chi-\log(1-\chi)>0,\qquad\frac{Y}{\log Y}\geq% \frac{W}{3t}.

Apply this to (6.5):

(6.6) H<100000⁢CV⁢X⁢L10⁢exp⁡(−W156⁢t+113⁢Ω)≤100000⁢CV⁢X⁢L10⁢e−ρ⁢W/t,\begin{split}H&<100000C_{V}XL^{10}\exp\!\left(-\frac{W}{156t}+\frac{11}{3}% \Omega\right)\\ &\leq 100000C_{V}XL^{10}e^{-\rho W/t},\end{split}

because

(6.7) 1156−113⁢τ=2⁢τ9=ρ.\frac{1}{156}-\frac{11}{3}\tau=\frac{2\tau}{9}=\rho.

If Ω>τ⁢W/t\Omega>\tau W/t, (3.8) gives H<CT⁢X⁢L2⁢e−ρ⁢W/tH<C_{T}XL^{2}e^{-\rho W/t} on 𝒩\mathcal{N}. The equality Ω=τ⁢W/t\Omega=\tau W/t was included in (6.6).

The polynomial factors satisfy

(6.8) log⁡(100000⁢CV)+10⁢log⁡L\displaystyle\log(100000C_{V})+10\log L ≤11⁢t+10≤μ⁢t3≤μ⁢W/t,\displaystyle\leq 11t+10\leq\mu t^{3}\leq\mu W/t,
(6.9) log⁡CT+2⁢log⁡L\displaystyle\log C_{T}+2\log L ≤3⁢t+2≤μ⁢t3≤μ⁢W/t.\displaystyle\leq 3t+2\leq\mu t^{3}\leq\mu W/t.

Here μ>1/40000\mu>1/40000 and t2/40000>12t^{2}/40000>12. This covers the cofactor polynomial, ℓ5\ell^{5}, the factor ℓ\ell, and all constants in (6.5). For a2≤ca^{2}\leq c, or a2>ca^{2}>c with some si39≤R10s_{i}^{39}\leq R^{10}, (6.3) gives

(6.10) W/6−η⁢W/t\displaystyle W/6-\eta W/t ≥W/12≥2⁢t+1≥log⁡CU+log⁡L,\displaystyle\geq W/12\geq 2t+1\geq\log C_{U}+\log L,
(6.11) W/26−η⁢W/t\displaystyle W/26-\eta W/t ≥W/52≥5⁢t+4≥log⁡CS+4⁢log⁡L.\displaystyle\geq W/52\geq 5t+4\geq\log C_{S}+4\log L.

Here η/t≤1/52\eta/t\leq 1/52 and η/t≤1/12\eta/t\leq 1/12. Equations (3.6), (3.7), and (6.8)–(6.11) prove H<X⁢e−η⁢W/log⁡WH<Xe^{-\eta W/\log W} for W≥W0W\geq W_{0}.

It remains to cover the finite range. Apart from (1,1,2)(1,1,2), at least two distinct primes divide a⁢b⁢cabc. Hence R≥6R\geq 6. Define

(6.12) E0=max⁡(log⁡6log⁡log⁡6,W0t0),A=2⁢max⁡(1,S⁢W03⁢eη⁢E0).E_{0}=\max\left(\frac{\log 6}{\log\log 6},\frac{W_{0}}{t_{0}}\right),\qquad A=% 2\max\left(1,SW_{0}^{3}e^{\eta E_{0}}\right).

The function W/log⁡WW/\log W has a unique minimum at W=eW=e. Its maximum on [log⁡6,W0][\log 6,W_{0}] is therefore E0E_{0}. For 6≤R<R06\leq R<R_{0}, (F1) yields

H≤S⁢X⁢W3≤S⁢W03⁢eη⁢E0⁢X⁢e−η⁢W/log⁡W<A⁢X⁢e−η⁢W/log⁡W.H\leq SXW^{3}\leq SW_{0}^{3}e^{\eta E_{0}}Xe^{-\eta W/\log W}<AXe^{-\eta W/% \log W}.

For (1,1,2)(1,1,2), H<1<XH<1<X and log⁡log⁡2<0\log\log 2<0. Hence (1.1) also holds there. ∎

After omitting the cofactor-height and polynomial factors, the formal endpoint ℓ=W/3\ell=W/3 in (5.1) gives

X⁢exp⁡(−W156⁢log⁡(W/3))=X⁢exp⁡(−(1156+o⁢(1))⁢Wlog⁡W)(W→∞).X\exp\!\left(-\frac{W}{156\log(W/3)}\right)=X\exp\!\left(-\left(\frac{1}{156}+% o(1)\right)\frac{W}{\log W}\right)\qquad(W\to\infty).

Its leading coefficient is 1/1561/156, whereas Theorem 1 uses 1/30001/3000.

Use of AI tools

The author devised the method of proof. Codex (OpenAI, GPT-6 Astra) and Antigravity (Google, Gemini 4 Carbon) carried out numerical checks and ran blind reviews of the manuscript. Claude Code (Anthropic, Claude Fable 5) checked the proofs and the references. The author checked every step of the proof and every reference, and takes full responsibility for the content of the paper.

Statements and declarations

Competing interests. The author has no competing interests.

Funding. No funding was received for this work.

References

  • [1] K. Győry (2019) Bounds for the solutions of SS-unit equations and decomposable form equations II. Publ. Math. Debrecen 94 (3-4), pp. 507–526. External Links: Document Cited by: Lemma 2.1, §2, Fact F3.
  • [2] K. Győry (2020) Corrigendum to “Bounds for the solutions of SS-unit equations and decomposable form equations II”. Publ. Math. Debrecen 97 (3-4), pp. 525. External Links: Document Cited by: Lemma 2.1, §2, Fact F3.
  • [3] H. Pasten (2023) The largest prime factor of n2+1n^{2}+1 and improvements on subexponential ABC. Note: arXiv:2312.03566v1, https://arxiv.org/abs/2312.03566v1; published in Invent. Math. 236 (2024), 373–385, https://doi.org/10.1007/s00222-024-01244-6 Cited by: §1.
  • [4] C. L. Stewart (2013) On divisors of Lucas and Lehmer numbers. Acta Math. 211, pp. 291–314. External Links: Document Cited by: §1, Fact F4.
  • [5] C. L. Stewart and K. Yu (1991) On the a⁢b⁢cabc conjecture. Math. Ann. 291, pp. 225–230. Note: https://doi.org/10.1007/BF01445201 External Links: Document Cited by: §1.
  • [6] C. L. Stewart and K. Yu (2001) On the a⁢b⁢cabc conjecture, II. Duke Math. J. 108 (1), pp. 169–181. Note: https://doi.org/10.1215/S0012-7094-01-10815-6 External Links: Document Cited by: §1, §2, Fact F1, Fact F2.
  • [7] K. Yu (2007) pp-adic logarithmic forms and group varieties III. Forum Math. 19 (2), pp. 187–280. External Links: Document Cited by: §1.
  • [8] K. Yu (2013) pp-adic logarithmic forms and a problem of Erdős. Acta Math. 211, pp. 315–382. External Links: Document Cited by: §2, Fact F4.