2023/11/25 by Hirotaka Kobayashi, Yuta Suzuki, Kobayashi, Hirotaka +3
Mathematics · Computer Science · #Analytic Number Theory Research #Limits and Structures in Graph Theory #Coding theory and cryptography
paper · pdf · doi:10.48550/arxiv.2311.15002
For a given base g≥2, 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≥2, which solves an open problem proposed by Banks and Shparlinski (2005).