Every positive integer is a sum of three palindromes
From MaRDI portal
Publication:3177730
Recommendations
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 Simultaneous Palindromes
- On binary palindromes of the form \(10^n\pm 1\)
- On the curvature of space.
- Palindromes in Lucas sequences
- Palindromes in linear recurrence sequences
- Power values of palindromes
- Prime divisors of palindromes
Cited in
(15)- Quotients of palindromic and antipalindromic numbers
- Lagrange's theorem for binary squares
- Say no to case analysis: automating the drudgery of case-based proofs
- Exact formulas for the number of palindromes in certain arithmetic progressions
- Most integers are not a sum of two palindromes
- Additive number theory via automata theory
- scientific article; zbMATH DE number 7069711 (Why is no real title available?)
- Sums of Palindromes: an Approach via Automata
- Reciprocal sum of palindromes
- Combinatorial structure and sumsets associated with Beatty sequences generated by powers of the golden ratio
- On Simultaneous Palindromes
- ADDITIVE BASES AND NIVEN NUMBERS
- Every natural number is the sum of forty-nine palindromes
- Additive Number Theory via Approximation by Regular Languages
- Longest arithmetic progressions of palindromes
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)