Abstract
Let \({a \geqq 2}\) be an even integer and let \({L \geqq 1}\) be an integer. We show that for a sufficiently large x, the number of primes \({p \leqq x}\) such that 2p + 2a, . . . , 2p + 2La can not be expressed as \({a^{k} +\phi(m)}\) is at least \({C(a,L) \frac{x}{log x}}\), where k, m are positive integers, \({\phi(m)}\) is the Euler totient function and the constant C(a, L) depends on a, L.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.