2024/04/24 by David Conlon, Jacob Fox, Conlon, David +11
Mathematics · #Advanced Mathematical Identities #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2404.16016
openalex publication_date 2024/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Answering a question of Erdős and Graham, we show that for each fixed positive rational number x the number of ways to write x as a sum of reciprocals of distinct positive integers each at most n is 2(cx + o(1))n for an explicit constant cx increasing with x.