Abstract
Abstract For $g \geqslant 2$ , we show that the number of positive integers at most X which can be written as sum of two base g palindromes is at most ${X}/{\log^c X}$ . This answers a question of Baxter, Cilleruelo and Luca.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
