2000 character limit reached
On distinct residues of factorials
Published 13 Mar 2016 in math.NT | (1603.04086v1)
Abstract: We investigate the existence of primes $p > 5$ for which the residues of $2!$, $3!$, \dots, $(p-1)!$ modulo $p$ 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 $10{11}$.
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.