A note on the least totient of a residue class
M. Z. Garaev

TL;DR
This paper improves the upper bound on the size of integers with Euler's totient in a given residue class modulo a large prime, reducing it from roughly q^{5/2} to q^{2} with a small epsilon.
Contribution
The authors improve the bound on the least integer with a given totient residue class modulo a prime from q^{5/2+ε} to q^{2+ε}.
Findings
Bound on n is improved to n ≪ q^{2+ε}.
The result applies to large prime moduli q.
Enhances understanding of Euler's totient distribution in residue classes.
Abstract
Let be a large prime number, be any integer, be a fixed small positive quantity. Friedlander and Shparlinksi \cite{FSh} have shown that there exists a positive integer such that falls into the residue class Here, denotes Euler's function. In the present paper we improve this bound to
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Advanced Algebra and Logic · Optimization and Search Problems
