Computational investigations of the Prouhet-Tarry-Escott Problem

DOI10.1090/S0025-5718-02-01504-1zbMath1026.11094OpenAlexW2008455956MaRDI QIDQ4417179

Petr Lisoněk, Colin Percival, Peter B. Borwein

Publication date: 28 July 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-02-01504-1

zbMATH Keywords

Prouhet-Tarry-Escott problemcomputer solutionsDiophantine equations in many variables

Mathematics Subject Classification ID

Waring's problem and variants (11P05) Computer solution of Diophantine equations (11Y50) Diophantine equations in many variables (11D72)

Related Items (6)

NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ Shifted power of a polynomial with integral roots ⋮ Irreducibility criteria of Schur-type and Pólya-type ⋮ On the number of solutions of the Tarry-Escott problem of degree two and the related problem over some finite fields ⋮ Newton polygons and the Prouhet-Tarry-Escott problem ⋮ The Prouhet-Tarry-Escott problem for Gaussian integers

Cites Work

• Computational excursions in analysis and number theory
• A geometric approach to equal sums of fifth powers
• The Prouhet-Tarry-Escott problem revisited
• Über mehrgradige Gleichungen
• Unnamed Item

This page was built for publication: Computational investigations of the Prouhet-Tarry-Escott Problem