On the number of distances between the coordinates of points on modular hyperbolas (Q2483163): Difference between revisions

Let \(p\) be an odd prime and \(a\) a fixed integer coprime to \(p\). The modular hyperbola consists of the pairs \((x,y)\) with \(x\) and \(y\) integers such that \(xy\equiv a\pmod p\). The authors consider the number of different Euclidean distances \(| x-y| \) with \((x,y)\) on the modular hyperbola and \(1\leq x\leq X\) and \(1\leq y\leq Y\) and give an asymptotic formula for this quantity. In case \(X=Y=p-1\) they give an exact formula involving the Legendre symbol of \(a\pmod p\).