arXiv · 2311.15002
Counting relatively prime pairs of palindromes
Abstract
For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a fixed odd length and of any base $g\ge2$, which solves an open problem proposed by Banks and Shparlinski (2005).
Explore related subjects
Keep this discovery
Hirotaka Kobayashi, Yuta Suzuki, Ryota Umezawa. 2023-11-25. Counting relatively prime pairs of palindromes. https://arxiv.org/abs/2311.15002
Cite the original work for its findings. Save a collection to share your selection of sources.