Short Egyptian fractions
There are absolute constants and such that, for every integer , , and in particular the upper bound holds for every integer numerator .
The deduction from Proposition 2.1, Lemma 2.2, and Lemma 2.3 is elementary, complete, and rigorous, and Proposition 2.1 is fully proved in Section 5.
“Theorem 1.1. There are absolute constants c1, c2 > 0 and b0 such that, for every integer b ≥ b0, c1 log log b ≤ N(b) ≤ c2 log log b. In particular, the upper bound holds for every integer numerator 1 ≤ a < b.” · Show in paper