Abstract
We show that for a fixed integer base g ≥ 2 the palindromes to base g which are k-powers form a very thin set in the set of all base g palindromes. On the other hand, we also give a lower bound which shows that there are more such palindromes than some standard heuristic arguments suggest.
| Original language | English |
|---|---|
| Pages (from-to) | 101-107 |
| Number of pages | 7 |
| Journal | Journal of combinatorics and number theory |
| Volume | 1 |
| Issue number | 2 |
| Publication status | Published - 2009 |
Keywords
- palindromes
- powers