On number of integers representable as a sum of unit fractions. II (Q1377591): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3872528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4841598 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Length and denominators of Egyptian fractions. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Number of Integers Representable as Sums of Unit Fractions / rank | |||
Normal rank |
Latest revision as of 10:27, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On number of integers representable as a sum of unit fractions. II |
scientific article |
Statements
On number of integers representable as a sum of unit fractions. II (English)
0 references
24 January 1999
0 references
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 \).
0 references
Egyptian unit fractions
0 references
asymptotic formula for the number of integers representable as sums of unit fractions
0 references