# Can the Landau-Ramanujan Constant be generalized towards cubes?

The Landau-Ramanujan Constant is related to the sum of 2 squares. See : http://en.wikipedia.org/wiki/Landau%E2%80%93Ramanujan_constant

Can a similar thing be said for the sum of 4 positive cubes ? Or any other (nontrivial) fixed amount of positive cubes ?

In other words can the Landau-Ramanujan Constant be generalized towards positive cubes ?

In particular Im intrested in the following :

Let $n,m$ be positive integers. Let $f_n(m)$ be the counting function for the sum of $n$ positive cubes.

I assume ( and have been told later by my master ) that

$$f_n(m) = \dfrac {C_n m^{a_n}}{ln(m)^{b_n}ln(ln(m))^{c_n}}+O(1)$$

Where $C_n,a_n,b_n,c_n$ are real numbers depending on $n$ only.

The $O(1)$ implies a Landau-Ramanujan like constant.

I wonder what the values are for $C_4,a_4,b_4,c_4,C_5,a_5,b_5,c_5,C_6,a_6,b_6,c_6$ ?

I read that Davenport proved that

$$f_3(m) << m^{54/47 + \epsilon}$$ for every $$\epsilon > 0$$

But I was not able to find more related things.

• Not sure what you mean by "The $O(1)$ implies a Landau-Ramanujan like constant". That would only require a multiplicative error of $(1 + o(1))$. An additive error of $O(1)$ is far too sharp to expect, and I suspect provably false in the sum-of-squares case. – Erick Wong Jan 31 '15 at 16:28

It is known that every positive integer $n$ not congruent to $4$ or $5$ mod $9$ is the sum of four cubes, allowing negative cubes. It is an open problem if four cubes always suffice (but it is suspected). For $5$ cubes it is known to be true. So the answer depends on one hand how many cubes we ask for. For $5$ cubes the answer is yes, for four cubes we do not know (I think). If we require non-negative cubes, then we need more cubes. It is known that every integer $n≥ exp(524)$ is a sum of seven non negative cubes.