Abstract
Let $$\varphi (n) = \#(\mathbb {Z}/n\mathbb {Z})^{\times }$$ (Euler’s totient function). Let $$\epsilon > 0$$ , and let $$\alpha \in (0,1)$$ . We prove that for all $$x > x_0(\epsilon ,\alpha )$$ and every subset $$\mathscr {S}$$ of [1, x] with $$\#\mathscr {S}\le x^{1-\alpha }$$ , the number of $$n\le x$$ with $$\varphi (n)\in \mathscr {S}$$ is at most $$x/L(x)^{\alpha -\epsilon }$$ , where $$\begin{aligned} L(x) = \exp (\log x\cdot \log _3{x}/\log _2 x). \end{aligned}$$ Under plausible conjectures on the distribution of smooth shifted primes, this upper bound is best possible, in the sense that the number $$\alpha $$ appearing in the exponent of L(x) cannot be replaced by anything larger.
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.