Power-free palindromes and reversed primes

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chourasiya, Shashi, Johnston, Daniel R.
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912721539170304
author Chourasiya, Shashi
Johnston, Daniel R.
author_facet Chourasiya, Shashi
Johnston, Daniel R.
contents We prove new results related to the digital reverse $\overleftarrow{n}$ of a positive integer $n$ in a fixed base $b$. First we show that for $b\geq 26000$, there exists infinitely many primes $p$ such that $\overleftarrow{p}$ is square-free. Further, we show that for $b\geq 2$ there are infinitely many palindromes (with $n=\overleftarrow{n}$) that are cube-free. We also give asymptotic expressions for the counting functions corresponding to these results. The main tools we use are recent bounds from the literature on reversed primes and palindromes in arithmetic progressions.
format Preprint
id arxiv_https___arxiv_org_abs_2503_21136
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Power-free palindromes and reversed primes
Chourasiya, Shashi
Johnston, Daniel R.
Number Theory
11A63 (Primary) 11N37, 11Y35 (Secondary)
We prove new results related to the digital reverse $\overleftarrow{n}$ of a positive integer $n$ in a fixed base $b$. First we show that for $b\geq 26000$, there exists infinitely many primes $p$ such that $\overleftarrow{p}$ is square-free. Further, we show that for $b\geq 2$ there are infinitely many palindromes (with $n=\overleftarrow{n}$) that are cube-free. We also give asymptotic expressions for the counting functions corresponding to these results. The main tools we use are recent bounds from the literature on reversed primes and palindromes in arithmetic progressions.
title Power-free palindromes and reversed primes
topic Number Theory
11A63 (Primary) 11N37, 11Y35 (Secondary)
url https://arxiv.org/abs/2503.21136