The logarithm of the cardinality of Egyptian fractions with denominators ≤ N satisfies (N / log N) times product of iterated logs from 3 to k < log(#E_N) < 0.421 N for fixed k ≥ 3 and large N.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting Egyptian fractions
The logarithm of the cardinality of Egyptian fractions with denominators ≤ N satisfies (N / log N) times product of iterated logs from 3 to k < log(#E_N) < 0.421 N for fixed k ≥ 3 and large N.