Sum of four cubes problem

Last updated
Unsolved problem in mathematics:
Is every integer the sum of four perfect cubes?

The sum of four cubes problem [1] asks whether every integer is the sum of four cubes of integers. It is conjectured the answer is affirmative, but this conjecture has been neither proven nor disproven. [2] Some of the cubes may be negative numbers, in contrast to Waring's problem on sums of cubes, where they are required to be positive.

Contents

Partial results

The substitutions , , and in the identity lead to the identity which shows that every integer multiple of 6 is the sum of four cubes. (More generally, the same proof shows that every multiple of 6 in every ring is the sum of four cubes.)

Since every integer is congruent to its own cube modulo 6, it follows that every integer is the sum of five cubes of integers.

In 1966, V. A. Demjanenko  [ de ] proved that any integer that is congruent neither to 4 nor to −4 modulo 9 is the sum of four cubes of integers. For this, he used the following identities: These identities (and those derived from them by passing to opposites) immediately show that any integer which is congruent neither to 4 nor to −4 modulo 9 and is congruent neither to 2 nor to −2 modulo 18 is a sum of four cubes of integers. Using more subtle reasonings, Demjanenko proved that integers congruent to 2 or to −2 modulo 18 are also sums of four cubes of integers. [3]

The problem therefore only arises for integers congruent to 4 or to −4 modulo 9. One example is but it is not known if every such integer can be written as a sum of four cubes.

18x±2 case

According to Henri Cohen's translation [4] of Demjanenko's paper, these identities

together with their complementary identities leave the 108x±38 case, proving the proposition.[ clarification needed ] He also proves the 108x±38 case in his paper.

See also

Notes and references

  1. Referred to as the "four cube problem" in H. Davenport, The Higher Arithmetic: An Introduction to the Theory of Numbers, Cambridge University Press, 7th edition, 1999, p. 173, 177.
  2. At least in 1982. See Philippe Revoy, “Sur les sommes de quatre cubes”, L’Enseignement Mathématique, t. 29, 1983, p. 209-220, online here or here, p. 209 on the point in question.
  3. V.A. Demjanenko, "On sums of four cubes", Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, vol. 54, no. 5, 1966, p. 63-69, available online at the site Math-Net.Ru. For a demonstration in French, see Philippe Revoy, “Sur les sommes de quatre cubes”, L’Enseignement Mathématique, t. 29, 1983, p. 209-220, online here or here.
  4. http://www.math.u-bordeaux1.fr/~cohen/sum4cub.ps

Related Research Articles

<span class="mw-page-title-main">Elementary algebra</span> Basic concepts of algebra

Elementary algebra, also known as college algebra, encompasses the basic concepts of algebra. It is often contrasted with arithmetic: arithmetic deals with specified numbers, whilst algebra introduces variables.

<span class="mw-page-title-main">Modular arithmetic</span> Computation modulo a fixed integer

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

<span class="mw-page-title-main">Natural logarithm</span> Logarithm to the base of the mathematical constant e

The natural logarithm of a number is its logarithm to the base of the mathematical constant e, which is an irrational and transcendental number approximately equal to 2.718281828459. The natural logarithm of x is generally written as ln x, logex, or sometimes, if the base e is implicit, simply log x. Parentheses are sometimes added for clarity, giving ln(x), loge(x), or log(x). This is done particularly when the argument to the logarithm is not a single symbol, so as to prevent ambiguity.

In mathematics, a polynomial is a mathematical expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication and exponentiation to nonnegative integer powers, and has a finite number of terms. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2yz + 1.

<span class="mw-page-title-main">Gaussian integer</span> Complex number whose real and imaginary parts are both integers

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as or

<span class="mw-page-title-main">Factorization</span> (Mathematical) decomposition into a product

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4.

<span class="mw-page-title-main">Completing the square</span> Method for solving quadratic equations

In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form to the form for some values of h and k.

<span class="mw-page-title-main">Lagrange's four-square theorem</span> Every natural number can be represented as the sum of four integer squares

Lagrange's four-square theorem, also known as Bachet's conjecture, states that every natural number can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four. where the four numbers are integers. For illustration, 3, 31, and 310 in several ways, can be represented as the sum of four squares as follows:

<span class="mw-page-title-main">Cube (algebra)</span> Number raised to the third power

In arithmetic and algebra, the cube of a number n is its third power, that is, the result of multiplying three instances of n together. The cube of a number or any other mathematical expression is denoted by a superscript 3, for example 23 = 8 or (x + 1)3.

A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a2b3, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.

In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number p, then this root can be lifted to a unique root modulo any higher power of p. More generally, if a polynomial factors modulo p into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of p.

In additive number theory, Fermat's theorem on sums of two squares states that an odd prime p can be expressed as:

In mathematics, a binary quadratic form is a quadratic homogeneous polynomial in two variables

The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer that is 2 or more, there exist positive integers , , and for which In other words, the number can be written as a sum of three positive unit fractions.

In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials with non-zero coefficients. The degree of a term is the sum of the exponents of the variables that appear in it, and thus is a non-negative integer. For a univariate polynomial, the degree of the polynomial is simply the highest exponent occurring in the polynomial. The term order has been used as a synonym of degree but, nowadays, may refer to several other concepts.

In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m. In the standard notation of modular arithmetic this congruence is written as

In mathematics and statistics, sums of powers occur in a number of contexts:

<i>Jade Mirror of the Four Unknowns</i> 1303 mathematical monograph by Zhu Shijie

Jade Mirror of the Four Unknowns, Siyuan yujian (四元玉鉴), also referred to as Jade Mirror of the Four Origins, is a 1303 mathematical monograph by Yuan dynasty mathematician Zhu Shijie. Zhu advanced Chinese algebra with this Magnum opus.

<span class="mw-page-title-main">Sums of three cubes</span> Problem in number theory

In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum. A necessary condition for an integer to equal such a sum is that cannot equal 4 or 5 modulo 9, because the cubes modulo 9 are 0, 1, and −1, and no three of these numbers can sum to 4 or 5 modulo 9. It is unknown whether this necessary condition is sufficient.