Definitions from Wiktionary (Prouhet-Tarry-Escott problem)
▸ noun: (mathematics) 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.
▸ Words similar to Prouhet-Tarry-Escott problem
▸ Usage examples for Prouhet-Tarry-Escott problem
▸ Idioms related to Prouhet-Tarry-Escott problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Prouhet-Tarry-Escott problem
▸ Rhymes of Prouhet-Tarry-Escott problem
▸ Invented words related to Prouhet-Tarry-Escott problem
▸ noun: (mathematics) 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.
Similar:
Brocard's problem,
Basel problem,
Waring's problem,
stable marriage problem,
Heesch's problem,
Schinzel's hypothesis H,
double counting,
pigeonhole principle,
additive combinatorics,
Bongard problem,
more...
▸ Words similar to Prouhet-Tarry-Escott problem
▸ Usage examples for Prouhet-Tarry-Escott problem
▸ Idioms related to Prouhet-Tarry-Escott problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Prouhet-Tarry-Escott problem
▸ Rhymes of Prouhet-Tarry-Escott problem
▸ Invented words related to Prouhet-Tarry-Escott problem