Prime divisors of palindromes (Q2368600): Difference between revisions

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.