English

Improved algorithms for left factorial residues

Number Theory 2020-12-21 v3 Symbolic Computation

Abstract

We present improved algorithms for computing the left factorial residues !p=0!+1!+...+(p1)! ⁣modp!p=0!+1!+...+(p-1)! \!\mod p. We use these algorithms for the calculation of the residues !p ⁣modp!p\!\mod p, for all primes pp up to 2402^{40}. Our results confirm that Kurepa's left factorial conjecture is still an open problem, as they show that there are no odd primes p<240p<2^{40} such that pp divides !p!p. Additionally, we confirm that there are no socialist primes pp with 5<p<2405<p<2^{40}.

Keywords

Cite

@article{arxiv.1904.09196,
  title  = {Improved algorithms for left factorial residues},
  author = {Vladica Andrejić and Alin Bostan and Milos Tatarevic},
  journal= {arXiv preprint arXiv:1904.09196},
  year   = {2020}
}

Comments

final version, minor changes

R2 v1 2026-06-23T08:44:45.945Z