Distribution of factorials modulo p
Oleksiy Klurman, Marc Munsch

TL;DR
This paper proves new lower bounds on the number of distinct residue classes taken by factorials modulo p within short intervals, and estimates the average number of residue classes missed by factorials for primes up to x.
Contribution
It improves the known bounds on the distribution of factorials modulo p in short intervals and provides average estimates for missed residue classes.
Findings
Factorials occupy at least da in short intervals for N a p^{1/4}
Established lower bounds on the number of distinct residue classes of n! mod p
Estimated the average number of residue classes missed by factorials for primes p a x.
Abstract
We prove that the sequence occupies at least residue classes in the short interval and improving previously known trivial bound In the other direction, we estimate the average number of residue classes missed by the sequence for
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 · Mathematical Approximation and Integration · Coding theory and cryptography
