Let k be a fixed integer, k 2, and suppose that =>0. We show that every sufficiently large integer n can be expressed in the form n=m 1 +m 2 + } } } +m k where d(m i )>n (log 2&=)(1&1Γk)Γlog log n for all i. This is best possible, since there are infinitely many exceptional n if the factor log 2&= i
Sums of Numbers with Small Partial Quotients II
β Scribed by S. Astels
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 131 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
For m Β₯ Z + let F(m) be the set of numbers with an infinite continued fraction expansion where all partial quotients, except possibly the first, do not exceed m. In 1975, James Hlavka conjectured that F( )+F( ) ] R. We shall disprove Hlavka's conjecture, showing that in fact F(5) Β± F(2)=R.
π SIMILAR VOLUMES
We investigate a number of questions concerning representations of a set of numbers as sums of subsets of some other set. In particular, we obtain several results on the possible sizes of the second set when the first set consists of a geometric sequence of integers, partially answering a generalisa