On Waring's problem for cubes

1991 ◽  
Vol 109 (2) ◽  
pp. 229-256 ◽  
Author(s):  
Jörg Brüdern
Keyword(s):  
Singular Series ◽  
Natural Numbers ◽  
Additive Theory ◽  
Waring’S Problem ◽  
Waring's Problem ◽  
Quantitative Form ◽  
Image Position ◽  
Theory Of Numbers

A classical conjecture in the additive theory of numbers is that all sufficiently large natural numbers may be written as the sum of four positive cubes of integers. This is known as the Four Cubes Problem, and since the pioneering work of Hardy and Littlewood one expects a much more precise quantitative form of the conjecture to hold. Let v(n) be the number of representations of n in the proposed manner. Then the expected formula takes the shapewhere (n) is the singular series associated with four cubes as familiar in the Hardy–Littlewood theory.

A problem in additive number theory

1988 ◽  
Vol 103 (1) ◽  
pp. 27-33 ◽  
Author(s):  
Jörg Brüdern
Keyword(s):  
Number Theory ◽  
Additive Number Theory ◽  
Interesting Problem ◽  
Natural Numbers ◽  
Additive Theory ◽  
Additive Number ◽  
Image Position ◽  
Theory Of Numbers

The determination of the minimal s such that all large natural numbers n admit a representation asis an interesting problem in the additive theory of numbers and has a considerable literature, For historical comments the reader is referred to the author's paper [2] where the best currently known result is proved. The purpose here is a further improvement.

Note on the representation of integers as sums of certain powers

1969 ◽  
Vol 65 (2) ◽  
pp. 445-446 ◽  
Author(s):  
K. Thanigasalam
Keyword(s):  
Asymptotic Formula ◽  
Natural Number ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Waring's Problem ◽  
Representation Of Integers ◽  
Image Position ◽  
Large Natural Number

In the paper entitled ‘Asymptotic formula in a generalized Waring's problem’, I established an asymptotic formula for the number of representations of a large natural number N in the formwhere x1, x2, …, x7 and k are natural numbers with k ≥ 4 (see (2) Theorem 2).

scholarly journals On Waring’s problem: Three cubes and a sixth power

2001 ◽  
Vol 163 ◽  
pp. 13-53 ◽  
Author(s):  
Jörg Brüdern ◽  
Trevor D. Wooley
Keyword(s):  
Exponential Sums ◽  
Large Integer ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Smooth Numbers ◽  
Waring's Problem ◽  
Order Of Magnitude ◽  
Almost All ◽  
Hardy Littlewood Method

We establish that almost all natural numbers not congruent to 5 modulo 9 are the sum of three cubes and a sixth power of natural numbers, and show, moreover, that the number of such representations is almost always of the expected order of magnitude. As a corollary, the number of representations of a large integer as the sum of six cubes and two sixth powers has the expected order of magnitude. Our results depend on a certain seventh moment of cubic Weyl sums restricted to minor arcs, the latest developments in the theory of exponential sums over smooth numbers, and recent technology for controlling the major arcs in the Hardy-Littlewood method, together with the use of a novel quasi-smooth set of integers.

scholarly journals A light-weight version of Waring's problem

2004 ◽  
Vol 76 (3) ◽  
pp. 303-316 ◽  
Author(s):  
Trevor D. Wooley
Keyword(s):  
Asymptotic Formula ◽  
Large Integer ◽  
Light Weight ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Waring's Problem ◽  
Large Solutions ◽  
Homogeneous Weight

AbstractAn asymptotic formula is established for the number of representations of a large integer as the sum of kth powers of natural numbers, in which each representation is counted with a homogeneous weight that de-emphasises the large solutions. Such an asymptotic formula necessarily fails when this weight is excessively light.

scholarly journals On Waring’s problem: Three cubes and a minicube

2010 ◽  
Vol 200 ◽  
pp. 59-91 ◽  
Author(s):  
Jörg Brüdern ◽  
Trevor D. Wooley
Keyword(s):  
Exponential Sums ◽  
Independent Interest ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Waring's Problem ◽  
Almost All ◽  
Positive Integers

AbstractWe establish that almost all natural numbers n are the sum of four cubes of positive integers, one of which is no larger than n5/36. The proof makes use of an estimate for a certain eighth moment of cubic exponential sums, restricted to minor arcs only, of independent interest.

scholarly journals COUNTING THE NUMBER OF SOLUTIONS TO THE ERDŐS–STRAUS EQUATION ON UNIT FRACTIONS

2013 ◽  
Vol 94 (1) ◽  
pp. 50-105 ◽  
Author(s):  
CHRISTIAN ELSHOLTZ ◽  
TERENCE TAO
Keyword(s):  
Positive Integer ◽  
Lower Bounds ◽  
Diophantine Equation ◽  
Upper And Lower Bounds ◽  
Natural Numbers ◽  
Number Of Solutions ◽  
Waring’S Problem ◽  
Unit Fractions ◽  
Image Position ◽  
Positive Integers

AbstractFor any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $$\begin{eqnarray*}\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}\end{eqnarray*}$$ with $x, y, z$ positive integers. The Erdős–Straus conjecture asserts that $f(n)\gt 0$ for every $n\geq 2$. In this paper we obtain a number of upper and lower bounds for $f(n)$ or $f(p)$ for typical values of natural numbers $n$ and primes $p$. For instance, we establish that $$\begin{eqnarray*}N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\ll \displaystyle \sum _{p\leq N}f(p)\ll N\hspace{0.167em} {\mathop{\log }\nolimits }^{2} N\log \log N.\end{eqnarray*}$$ These upper and lower bounds show that a typical prime has a small number of solutions to the Erdős–Straus Diophantine equation; small, when compared with other additive problems, like Waring’s problem.

Sign in / Sign up

Export Citation Format

Share Document