Prime divisors of palindromes
The authors study some divisibility properties of palindromes in a fixed base \(g\geq 2\), i.e., numbers \(n=\sum_{k=0}^{L-1}a_k g^k\) with \(a_{L-1}\neq 0\) such that \(a_k=a_{L-1-k}\) for all \(k\). They prove that for sufficiently large \(L\), there is a palindrome \(n\) of length \(L\) which has at least \(\Omega(\log\log n/ \log\log\log n)\) distinct prime divisors. Furthermore, there is a constant \(C\) such that for every sufficiently large integer \(L\), each prime number less or equal to \(L^2(\log L)^{-C}\) with \(\gcd(p,g(g-1))=1\) divides some palindrome of length \(n\). The proofs use estimates for some exponential sums.
- Palindromes in Lucas sequences
- Almost all palindromes are composite.
- Additive number theory via automata theory
- Longest arithmetic progressions of palindromes
- Palindromic sums of proper divisors
- On d-digit palindromes in different bases: the number of bases is unbounded
- Every positive integer is a sum of three palindromes
- Sums of Palindromes: an Approach via Automata
- Palindromes dans les progressions arithmétiques
- scientific article; zbMATH DE number 4033813 (Why is no real title available?)
- scientific article; zbMATH DE number 4066991 (Why is no real title available?)
- Palindromes: Density and Divisibility
- On Simultaneous Palindromes
- Reciprocal sum of palindromes
- Reversible primes
- Exact formulas for the number of palindromes in certain arithmetic progressions
- Power-free palindromes and reversed primes
- Infinitude of palindromic almost-prime numbers
- On binary palindromes of the form \(10^n\pm 1\)
This page was built for publication: Prime divisors of palindromes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368600)
