Abstract:
Let $p$ be a large prime number, $h$ be a positive integer, $h<p,$ and $g$ be a primitive root modulo $p$. Let also $s,s_1$ be integers and
$$
\mathcal{K} = \{s+1, s+2, \ldots, s+h\}\times \{s_1+1, s_1+2, \ldots, s_1+h\}.
$$
In this talk I am planning to discuss the problem of estimating of the number of solutions
to the congruence
$$
y\equiv g^{x} \pmod{p}, \quad (x,y)\in \mathcal{K}.
$$