Prouhet-Tarry-Escott problem
Prouhet-Tarry-Escott problem proper noun: the problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k.
Proper noun
Prouhet-Tarry-Escott problem
Origin of Prouhet-Tarry-Escott problem
Named after Eugène Prouhet, who studied it in the early 1850s, and Gaston Tarry and Escott, who studied it in the early 1910s.
Questions about Prouhet-Tarry-Escott problem
- What does Prouhet-Tarry-Escott problem mean?
- Prouhet-Tarry-Escott problem means the problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k.
- What part of speech is Prouhet-Tarry-Escott problem?
- Prouhet-Tarry-Escott problem is a proper noun.
Words near Prouhet-Tarry-Escott problem in the dictionary
Source and license
Adapted from Wiktionary: Prouhet-Tarry-Escott problem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Prouhet-Tarry-Escott problem.” Word.ws, https://word.ws/prouhet-tarry-escott_problem. Based on Wiktionary, CC BY-SA 4.0.
