Every positive integer is a sum of three palindromes
From MaRDI portal
Publication:3177730
DOI10.1090/MCOM/3221zbMATH Open1441.11016arXiv1602.06208OpenAlexW2964257454MaRDI QIDQ3177730FDOQ3177730
Lewis Baxter, Florian Luca, Javier Cilleruelo
Publication date: 1 August 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Abstract: For integer , we prove that any positive integer can be written as a sum of three palindromes in base .
Full work available at URL: https://arxiv.org/abs/1602.06208
Cites Work
- On the curvature of space.
- Palindromes in Lucas sequences
- Palindromes in linear recurrence sequences
- On binary palindromes of the form \(10^n\pm 1\)
- Almost all palindromes are composite.
- Prime divisors of palindromes
- Commissioning of LIGO detectors
- On Simultaneous Palindromes
- Power values of palindromes
- Every natural number is the sum of forty-nine palindromes
- Average Value of the Euler Function on Binary Palindromes
Cited In (14)
- Additive number theory via automata theory
- Longest arithmetic progressions of palindromes
- Say no to case analysis: automating the drudgery of case-based proofs
- Sums of Palindromes: an Approach via Automata
- On Simultaneous Palindromes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Most integers are not a sum of two palindromes
- ADDITIVE BASES AND NIVEN NUMBERS
- Additive Number Theory via Approximation by Regular Languages
- Reciprocal Sum of Palindromes
- Exact formulas for the number of palindromes in certain arithmetic progressions
- Combinatorial structure and sumsets associated with Beatty sequences generated by powers of the golden ratio
Uses Software
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)
