2000 character limit reached
A New Proof of the Prouhet-Tarry-Escott Problem
Published 22 Nov 2014 in math.NT | (1411.6168v1)
Abstract: The famous Prouhet-Tarry-Escott problem seeks collections of mutually disjoint sets of non-negative integers having equal sums of like powers. In this paper we present a new proof of the solution to this problem by deriving a generalization of the product generating function formula for the classical Prouhet-Thue-Morse sequence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.