Expertini Research Research
Mathematics PDF Available Non-peer-reviewed Preprint

A note on $n!$ modulo $p$

M. Z. Garaev, J. Hernandez  ·  Published 2015-05-21

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$.

Keywords

📄 Full Paper Available as PDF
This paper is available as a downloadable PDF.
📄 Download PDF

✨ AI Plain-English Summary

Get a plain-English summary of this paper generated by AI (5 free per day).

Comments (0)

No comments yet. Be the first to comment.