Linear Congruences with Ratios

Published 11 Mar 2015 in math.NT | (1503.03196v1)

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}ⁿ a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables from rather general sets.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Igor E. Shparlinski

Collections

Sign up for free to add this paper to one or more collections.