Power values of palindromes

Javier Cilleruelo; Florian Luca; Igor E. Shparlinski

Power values of palindromes

Javier Cilleruelo, Florian Luca, Igor E. Shparlinski

Department of Computing

Research output: Contribution to journal › Article

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

Fingerprint Dive into the research topics of 'Power values of palindromes'. Together they form a unique fingerprint.

Cite this

@article{34907d3b7930443aac9b41924172a071,

title = "Power values of palindromes",

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.",

keywords = "palindromes, powers",

author = "Javier Cilleruelo and Florian Luca and Shparlinski, {Igor E.}",

year = "2009",

language = "English",

volume = "1",

pages = "101--107",

journal = "Journal of combinatorics and number theory",

issn = "1942-5600",

publisher = "Nova Science Publishers",

number = "2",

}

TY - JOUR

T1 - Power values of palindromes

AU - Cilleruelo, Javier

AU - Luca, Florian

AU - Shparlinski, Igor E.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - palindromes

KW - powers

M3 - Article

VL - 1

SP - 101

EP - 107

JO - Journal of combinatorics and number theory

JF - Journal of combinatorics and number theory

SN - 1942-5600

IS - 2

ER -