On number of integers representable as a sum of unit fractions. II
Denote by \(N(n)\) the set of positive integers \(a\) representable in the form \[ a = \sum_{\nu=1}^n {\varepsilon_\nu \over \nu}, \text{ where } \varepsilon \in \{0, 1\}. \] Continuing his research [in \textit{H. Yokota}, Can. Math. Bull. 33, 235-241 (1990; Zbl 0656.10012)], the author proves rather sharp lower and upper estimates for the number of elements in \( N(n) \): For all sufficiently large \(n\), \[ \left( 1 - {5 \log\log n \over \log n} \right) \leq {\#\{N(n)\} \over \log n} < \left( 1 + {1 \over \log n} \right). \] In particular, \( \# \{N(n)\} \sim \log n \).
- On the number of integers representable as sums of unit fractions. III.
- On Number of Integers Representable as Sums of Unit Fractions
- The number of representations of rationals as a sum of unit fractions
- The largest integer expressible as a sum of reciprocal of integers
- Sums of Distinct Unit Fractions
- The largest integer expressible as a sum of reciprocal of integers
- On the number of integers representable as sums of unit fractions. III.
- The number of representations of rationals as a sum of unit fractions
- On Number of Integers Representable as Sums of Unit Fractions
- The Number of Distinct Subsums of Σ N 1 l/i
- Groupoid cardinality and Egyptian fractions
- On some questions of Erdős and Graham about Egyptian fractions
- On the representation of rational numbers as a sum of a fixed number of unit fractions.
- Sums of Distinct Unit Fractions
This page was built for publication: On number of integers representable as a sum of unit fractions. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377591)
