English

Exponential Sums and Congruences with Factorials

Number Theory 2007-05-23 v1 Combinatorics

Abstract

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials n!m!n!m! and also derive asymptotic formulas for the number of solutions of various congruences with factorials. For example, we prove that the products of two factorials n!m!n!m! with max{n,m}<p1/2+ϵ\max\{n,m\}<p^{1/2+\epsilon} are uniformly distributed modulo pp, and that any residue class modulo pp is representable in the form m!n!+n1!+...+n49!m!n!+n_1! + ... +n_{49}! with max{m,n,n1,>...,n49}<p8775/8794+ϵ\max \{m,n, n_1, >..., n_{49}\} < p^{8775/8794+ \epsilon}.

Keywords

Cite

@article{arxiv.math/0403424,
  title  = {Exponential Sums and Congruences with Factorials},
  author = {Moubariz Z. Garaev and Florian Luca and Igor E. Shparlinski},
  journal= {arXiv preprint arXiv:math/0403424},
  year   = {2007}
}

Comments

21 pages