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 \[ ∑ j = 1 n a j x j y j ≡ a 0 ( mod p ) , \sum _{j=1}^n a_j \frac {x_j}{y_j} \equiv a_0 \pmod p, \] with variables from rather general sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
