Prouhet–Tarry–Escott problem
id:
prouhet-tarry-escott-problem-200-12917220
title:
Prouhet–Tarry–Escott problem
text:
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 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 ≤ n ≤ 10 and for n = 12 . No ideal solution is known for n = 11 or for n ≥ 13 . This proble
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Prouhet%E2%80%93Tarry%E2%80%93Escott_problem
date created:
date modified:
2022-09-14T13:29:39Z
main entity:
{"identifier":"Q3406235","url":"https://www.wikidata.org/entity/Q3406235"}
image:
fields total:
13
integrity:
13