Every positive integer is a sum of three palindromes

DOI10.1090/MCOM/3221MaRDI QIDQ3177730zbMATH OpenOpenAlexFDO

Authors Javier Cilleruelo, Florian Luca, Lewis Baxter

Publication date 1 August 2018

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

Full work available at URL https://arxiv.org/abs/1602.06208

zbMATH Keywords

sum of palindromes

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Additive bases, including sumsets (11B13)

Abstract: For integer $gge5$, we prove that any positive integer can be written as a sum of three palindromes in base $g$.

Recommendations

• Every natural number is the sum of forty-nine palindromes
• Reciprocal sum of palindromes
• Sums of Palindromes: an Approach via Automata
• Palindromes: Density and Divisibility
• Palindromes in different bases: a conjecture of J. Ernest Wilkins

Cites work

• Almost all palindromes are composite.
• Average Value of the Euler Function on Binary Palindromes
• Commissioning of LIGO detectors
• Every natural number is the sum of forty-nine palindromes
• On binary palindromes of the form \(10^n\pm 1\)
• On Simultaneous Palindromes
• On the curvature of space.
• Palindromes in linear recurrence sequences
• Palindromes in Lucas sequences
• Power values of palindromes
• Prime divisors of palindromes

Cited in

(17)

• Additive number theory via automata theory
• Longest arithmetic progressions of palindromes
• Say no to case analysis: automating the drudgery of case-based proofs
• Combinatorial structure and sumsets associated with Beatty sequences generated by powers of the golden ratio
• Every natural number is the sum of forty-nine palindromes
• Sums of Palindromes: an Approach via Automata
• Lagrange's theorem for binary squares
• ADDITIVE BASES AND NIVEN NUMBERS
• Quotients of palindromic and antipalindromic numbers
• On Simultaneous Palindromes
• Reciprocal sum of palindromes
• scientific article; zbMATH DE number 7069711 (Why is no real title available?)
• Additive Number Theory via Approximation by Regular Languages
• Exact formulas for the number of palindromes in certain arithmetic progressions
• Most integers are not a sum of two palindromes
• On minimum-base palindromic representations of powers of 2
• Infinitude of palindromic almost-prime numbers

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Every positive integer is a sum of three palindromes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177730)