Primes whose sum of digits is prime and metric number theory (Q2918795)

Let \(b\geq 2\) be an integer. The set \({\mathcal P}_b\) is defined to be the set of primes whose sum of digits in base \(b\) is also a prime. The author proves that for almost all \(\alpha>0\) (in the sense of Lebesgue measure), \(\limsup_{N\to\infty} (\log\log N)^{-1 } |\{ [\alpha b^n]\in {\mathcal P}_b; n\leq N\}|\geq (b-1)/(\phi(b-1)\log b)\) and \(\liminf_{N\to\infty} (\log\log N)^{-1 } |\{ [\alpha b^n]\in {\mathcal P}_b; n\leq N\}|\leq (b-1)/(\phi(b-1)\log b)\). Here, \(\phi(n)\) denotes Euler's totient function and \([\;]\) denotes the integer part.NEWLINENEWLINEThis generalizes an earlier result by the author [Proc. Lond. Math. Soc. (3) 75, No. 3, 481--496 (1997; Zbl 0891.11047)] and combines it with the result by \textit{M. Drmota} et al. [Compos. Math. 145, No. 2, 271--292 (2009; Zbl 1230.11013)] on primes with prescribed sum of digits.