2000 character limit reached
A note on $n!$ modulo $p$ (1505.05912v1)
Published 21 May 2015 in math.NT
Abstract: Let $p$ be a prime, $\varepsilon>0$ and $0<L+1<L+N < p$. We prove that if $p^{1/2+\varepsilon}< N <p^{1-\varepsilon}$, then $$ \#\{n!\!\!\! \pmod p;\,\, L+1\le n\le L+N\} > c (N\log N){1/2},\,\, c=c(\varepsilon)>0. $$ We use this bound to show that any $\lambda\not\equiv 0\pmod p$ can be represented in the form $\lambda \equiv n_1!...n_7!\pmod p$, where $n_i=o(p{11/12})$. This slightly refines the previously known range for $n_i$.