A subexponential upper bound for log c in the abc conjecture
Source: github.com/ryzfsu/abc-log-bound-subexponential/tree/7629a77…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-20-000026
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000026/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-20-000026/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'