Counting relatively prime pairs of palindromes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913265582342144 |
|---|---|
| author | Kobayashi, Hirotaka Suzuki, Yuta Umezawa, Ryota |
| author_facet | Kobayashi, Hirotaka Suzuki, Yuta Umezawa, Ryota |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_15002 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Counting relatively prime pairs of palindromes Kobayashi, Hirotaka Suzuki, Yuta Umezawa, Ryota Number Theory Primary: 11A63, Secondary: 11A05, 11N25, 11N69 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). |
| title | Counting relatively prime pairs of palindromes |
| topic | Number Theory Primary: 11A63, Secondary: 11A05, 11N25, 11N69 |
| url | https://arxiv.org/abs/2311.15002 |