2000 character limit reached
Improved algorithms for left factorial residues
Published 19 Apr 2019 in math.NT and cs.SC | (1904.09196v3)
Abstract: We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! !\mod p$. We use these algorithms for the calculation of the residues $!p!\mod p$, for all primes $p$ up to $2{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<2{40}$ such that $p$ divides $!p$. Additionally, we confirm that there are no socialist primes $p$ with $5<p<2{40}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.