On distinct residues of factorials
Vladica Andreji\'c, Milos Tatarevic

TL;DR
This paper explores primes greater than 5 for which factorial residues are all distinct modulo p, linking the problem to Kurepa's function and providing computational evidence up to 10^11.
Contribution
It establishes a connection between factorial residue distinctness and Kurepa's function, and reports computational results on primes less than 10^11.
Findings
No such primes less than 10^11 found
Connection established between factorial residues and Kurepa's function
Provides computational evidence for the conjecture
Abstract
We investigate the existence of primes for which the residues of , , \dots, modulo are all distinct. We describe the connection between this problem and Kurepa's left factorial function, and report that there are no such primes less than .
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.
