{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-20","reactions":{},"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"}]}