Multiplicative Congruences with Variables from Short Intervals

preprint2012arXivOpen access

Abstract

Recently, several bounds have been obtained on the number of solutions to congruences of the type (x1+s)...(xν+s)≡(y1+s)...(yν+s)≢0(modp) (x_1+s)...(x_ν+s)\equiv (y_1+s)...(y_ν+s)\not\equiv0 \pmod p modulo a prime pp with variables from some short intervals. Here, for almost all pp and all ss and also for a fixed pp and almost all ss, we derive stronger bounds. We also use similar ideas to show that for almost all primes, one can always find an element of a large order in any rather short interval.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.