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 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 with are uniformly distributed modulo , and that any residue class modulo is representable in the form with .
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