An additive problem with Ramanujan's function (Q2857874)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An additive problem with Ramanujan's function |
scientific article; zbMATH DE number 6229062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An additive problem with Ramanujan's function |
scientific article; zbMATH DE number 6229062 |
Statements
19 November 2013
0 references
Ramanujan \(\tau\)-function
0 references
additive basis
0 references
circle method
0 references
An additive problem with Ramanujan's function (English)
0 references
Let \(\tau (n)\) be the be the Ramanujan \(\tau\)-function. Using the circle method, the author proves that for any integer \(N\) the Diophantine equation NEWLINE\[NEWLINE \sum_{i=1}^{7544}\tau(n_i)=N NEWLINE\]NEWLINE has a solution in positive integers \(n_1,n_2,\dots,n_{7544}\) satisfying the condition NEWLINE\[NEWLINE \max_{1\leq i\leq 7544}n_i\ll |N|^{\frac{2}{11}}\,. NEWLINE\]NEWLINE This result improves the author's previous work in [Math. Notes 90, No. 5, 723--729 (2011); translation from Mat. Zametki 90, No. 5, 736--743 (2011; Zbl 1301.11048)] and [``On the representability of integers by the values of the Ramanujan function'', Mosc. Univ. Math. Bull. 66, No. 6, 270--272 (2011); translation from Vestn. Mosk. Univ. Ser. I 2011, No. 6, 49--52 (2011), \url{doi:10.3103/S0027132211060106}].
0 references
0.9282942414283752
0 references
0.8880801200866699
0 references
0.8595988154411316
0 references
0.7889271974563599
0 references