A note on Benli and Pollack's paper on small prime power residues
Crystel Bujold

TL;DR
This paper revisits and simplifies a proof regarding the count of small prime power residues, strengthening the bounds established by Benli and Pollack using reciprocity laws.
Contribution
It provides a simplified proof and slightly improved bounds on the number of small prime k-th power residues compared to prior work.
Findings
Simplified proof of bounds on small prime power residues
Stronger bounds established for the number of such residues
Utilizes reciprocity laws in the proof approach
Abstract
In this note, we revisit a result of Benli's and Pollack's on the number of small prime power residues. The proof is based on their idea of using reciprocity laws, but the argument is simplified and we prove a slightly stronger bound.
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
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
