Exponential Sums and Congruences with Factorials
Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski
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 \n,m\<p1/2+ε are uniformly distributed modulo p, and that any residue class modulo p is representable in the form m!n!+n1! + ... +n49! with \m,n, n1, >..., n49\ < p8775/8794+ ε.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan