Papers › Every positive integer is a sum of three palindromes

Every positive integer is a sum of three palindromes

19 Feb 2016arXiv:1602.06208links table onlyarchive 2025-07-28

Javier Cilleruelo, Florian Luca, Lewis Baxter

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

For integer g≥5, we prove that any positive integer can be written as a sum of three palindromes in base g.

PaperPDFCode

Code

TroyLaurin/PalindromeSum mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections