Pith. sign in

REVIEW 1 cited by

A New Proof of the Prouhet-Tarry-Escott Problem

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1411.6168 v1 pith:JL63YB35 submitted 2014-11-22 math.NT

Hieu D. Nguyen This is my paper · ORCID
classification math.NT
keywords problemproofprouhet-tarry-escottclassicalcollectionsderivingdisjointequal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Elucidating the Physical and Mathematical Properties of the Prouhet-Thue-Morse Sequence in Quantum Computing

    quant-ph 2025-01 conditional novelty 2.0 of 10

    The PTM logical states are the even and odd parity superposition states, so the paper's error correction and noise-resistance results reduce to standard parity-code facts.

Pith tools