Combinatorial etude
Miroslav Stoenchev, Venelin Todorov · Annals of Computer Science and Information Systems · 2021
The purpose of this article is to consider a special class of combinatorial problems, the so called Prouhet-Tarry-Escot problem, solution of which is realized by constructing finite sequences of ±1.For example, for fixed p ∈ N, is well known the existence of np ∈ N with the property: any set of np consecutive integers can be divided into 2 sets, with equal sums of its p thpowers.The considered property remains valid also for sets of finite arithmetic progressions of complex numbers.