Papers › Improved algorithms for left factorial residues
Improved algorithms for left factorial residues
Vladica Andrejić, Alin Bostan, Milos Tatarevic
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present improved algorithms for computing the left factorial residues !p=0!+1!+...+(p-1)! p. We use these algorithms for the calculation of the residues !pp, for all primes p up to 2⁴⁰. Our results confirm that Kurepa's left factorial conjecture is still an open problem, as they show that there are no odd primes p<2⁴⁰ such that p divides !p. Additionally, we confirm that there are no socialist primes p with 5<p<2⁴⁰.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections