Id: palomar/PALOMAR-2026-11-20-000026 Url: https://github.com/ryzfsu/abc-log-bound-subexponential/tree/7629a771c6f35598f1c56d32a5f13fb521e2ede0 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-20-000026-v1.json Repo: https://github.com/ryzfsu/abc-log-bound-subexponential Tags: math.NT, msc:11D75, msc:11J86, msc:11L20 Score: 0 Title: A subexponential upper bound for log c in the abc conjecture Trust: high Domain: math.NT Source: palomar Authors: Ruiyi Zhang Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-20 Formalized: true Formalizes: title=A subexponential upper bound for log c in the abc conjecture identifier=https://doi.org/10.5281/zenodo.24407806 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-20-000026 For every positive real epsilon, there is a positive constant C such that log c is at most C times rad(abc) to the power epsilon whenever a and b are positive coprime integers and a + b = c. The radical is the product of the distinct prime factors. This is an upper bound for log c. The abc conjecture itself remains open.