Abstract

Let pp be a prime, ε>0\varepsilon>0 and 0<L+1<L+N<p0<L+1<L+N < p. We prove that if p1/2+ε<N<p1−εp^{1/2+\varepsilon}< N <p^{1-\varepsilon}, then #{n! ⁣ ⁣ ⁣(modp);  L+1≤n≤L+N}>c(Nlog⁡N)1/2,  c=c(ε)>0. \#\{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 λ≢0(modp)λ\not\equiv 0\pmod p can be represented in the form λ≡n1!...n7!(modp)λ\equiv n_1!...n_7!\pmod p, where ni=o(p11/12)n_i=o(p^{11/12}). This slightly refines the previously known range for nin_i.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.