arXiv · 1503.03196
Linear Congruences with Ratios
Abstract
We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables from rather general sets.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Igor E. Shparlinski. 2015-03-11. Linear Congruences with Ratios. https://arxiv.org/abs/1503.03196
Cite the original work for its findings. Save a collection to share your selection of sources.