An editor has expressed a concern that this account may be a sockpuppet of Jagan83 ( talk · contribs · logs). Please refer to editing habits or contributions of the sockpuppet for evidence. This policy subsection may be helpful. Account information: block log – contribs – logs – abuse log – CentralAuth

Prouhet Tarry Escott problem general solutions

The Prouhet-Tarry-Escott problem can be stated as:

Given a positive integer n, find two sets of integer solutions { a1, a2, ... , am } and { b1, b2, ... , bm } such that the integers in each set have the same sum, the same sum of squares, etc., up to and including the same sum of nth powers, i.e., we are to find solutions in integers of the system of equations a1k + a2k + ... + amk = b1k + b2k + ... + bmk ( k = 1, 2, ..., n ) Solutions of this system will be denoted here by the notation [ a1 , a2 , ... , am ] = [ b1 , b2 , ... , bm ] ( k = 1, 2, ..., n )

Tarry Escott problem can be generated by special patterns

Below is the one of general solution for degree k=1,2 which is generated by special pattern.

{11c+a, 10c+d+10a-b, 11d-10b, 10d+c} = {10c+d,11d-b,10d-10b+c+a,11c+10a } a,b,c,d are integers.

for degree k=3 {11a-c, 10b+a ,10a-11c+b,11b-10c)={10a+b,11b-c,11a-10c, 10b-11c+a }