We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: A question of Erdős and Graham on Egyptian fractions

Abstract: Answering a question of Erd\H{o}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^{(c_x + o(1))n}$ for an explicit constant $c_x$ increasing with $x$.
Comments: 8 pages
Subjects: Combinatorics (math.CO); Number Theory (math.NT)
Cite as: arXiv:2404.16016 [math.CO]
  (or arXiv:2404.16016v1 [math.CO] for this version)

Submission history

From: David Conlon [view email]
[v1] Wed, 24 Apr 2024 17:50:12 GMT (12kb)

Link back to: arXiv, form interface, contact.