Exponential Sums and Congruences with Factorials
classification
🧮 math.NT
math.CO
keywords
factorialscongruencesepsilonexponentialmodulonumberproductssolutions
read the original 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!$ 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!$ with $\max\{n,m\}<p^{1/2+\epsilon}$ are uniformly distributed modulo $p$, and that any residue class modulo $p$ is representable in the form $m!n!+n_1! + ... +n_{49}!$ with $\max \{m,n, n_1, >..., n_{49}\} < p^{8775/8794+ \epsilon}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.