We obtain an asymptotic formula for the number of visible points (x,y), that is, with gcd(x, y) = 1, which lie in the box [1, U] x [1, V] and also belong to the exponential modular curves y≡ag~x (mod p). Among other tools, some recent results of additive combinatorics due to J. Bourgain and M. Z. Garaev play a crucial role in our argument.
展开▼
机译：我们获得一个可见点（x，y）的渐近公式，即gcd（x，y）= 1，它位于[1，U] x [1，V]框中，并且还属于指数模曲线y≡ag〜x（mod p）。在其他工具中，由J. Bourgain和M. Z. Garaev提出的加性组合运算的一些最新结果在我们的论证中起着至关重要的作用。
展开▼
