Prouhet–Tarry–Escott Problem

In mathematics, the Prouhet–Tarry–Escott problem asks for two disjoint multisets ''A'' and ''B'' of ''n'' integers each, whose first ''k'' power sum symmetric polynomials are all equal.
That is, the two multisets should satisfy the equations
:$\sum_ a^i = \sum_ b^i$
for each integer ''i'' from 1 to a given ''k''. It has been shown that ''n'' must be strictly greater than ''k''. Solutions with $k = n - 1$ are called ''ideal solutions''. Ideal solutions are known for $3 \le n \le 10$ and for $n = 12$. No ideal solution is known for $n=11$ or for $n \ge 13$.

This problem was named after Eugène Prouhet, who studied it in the early 1850s, and Gaston Tarry and Edward B. Escott, who studied it in the early 1910s. The problem originates from letters of Christian Goldbach and Leonhard Euler (1750/1751).

Examples

Ideal solutions

An ideal solution for ''n'' = 6 is given by the two sets
and , because:

: 0¹ + 5¹ + 6¹ + 16¹ + 17¹ + 22¹ = 1¹ + 2¹ + 10¹ + 12¹ + 20¹ + 21¹

: 0² + 5² + 6² + 16² + 17² + 22² = 1² + 2² + 10² + 12² + 20² + 21²

: 0³ + 5³ + 6³ + 16³ + 17³ + 22³ = 1³ + 2³ + 10³ + 12³ + 20³ + 21³

: 0⁴ + 5⁴ + 6⁴ + 16⁴ + 17⁴ + 22⁴ = 1⁴ + 2⁴ + 10⁴ + 12⁴ + 20⁴ + 21⁴

: 0⁵ + 5⁵ + 6⁵ + 16⁵ + 17⁵ + 22⁵ = 1⁵ + 2⁵ + 10⁵ + 12⁵ + 20⁵ + 21⁵.

For ''n'' = 12, an ideal solution is given by ''A'' = and ''B'' = .

Other solutions

Prouhet used the Thue–Morse sequence to construct a solution with $n=2^k$ for any $k$. Namely, partition the numbers from 0 to $2^-1$ into a) the numbers each with an even number of ones in its binary expansion and b) the numbers each with an odd number of ones in its binary expansion; then the two sets of the partition give a solution to the problem.. For instance, for $n=8$ and $k=3$, Prouhet's solution is:
:0¹ + 3¹ + 5¹ + 6¹ + 9¹ + 10¹ + 12¹ + 15¹ = 1¹ + 2¹ + 4¹ + 7¹ + 8¹ + 11¹ + 13¹ + 14¹
:0² + 3² + 5² + 6² + 9² + 10² + 12² + 15² = 1² + 2² + 4² + 7² + 8² + 11² + 13² + 14²
:0³ + 3³ + 5³ + 6³ + 9³ + 10³ + 12³ + 15³ = 1³ + 2³ + 4³ + 7³ + 8³ + 11³ + 13³ + 14³.

Generalizations

A higher dimensional version of the Prouhet–Tarry–Escott problem has been introduced and studied by Andreas Alpers and Robert Tijdeman in 2007: Given parameters $n,k \in \mathbb$, find two different multi-sets $\$, $\$ of points from $\mathbb^2$ such that

:$\sum_^nx_i^jy_i^=\sum_^n_i^j_i^$

for all $d,j \in \$ with $j \leq d.$ This problem is related to discrete tomography and also leads to special Prouhet-Tarry-Escott solutions over the Gaussian integers (though solutions to the Alpers-Tijdeman problem do not exhaust the Gaussian integer solutions to Prouhet-Tarry-Escott).

A solution for $n=6$ and $k=5$ is given, for instance, by:

:$\=\$ and

:$\=\$.

No solutions for $n=k+1$ with $k\geq6$ are known.

See also

* Euler's sum of powers conjecture
* Beal's conjecture
* Jacobi–Madden equation
* Lander, Parkin, and Selfridge conjecture
* Taxicab number
* Pythagorean quadruple
* Sums of powers, a list of related conjectures and theorems
* Discrete tomography

Notes

References

* Chap.11.
*.

External links

*

{{DEFAULTSORT:Prouhet-Tarry-Escott problem
Diophantine equations
Mathematical problems