in short intervals
For any sufficiently large real number , the interval contains at least one integer having at most two prime factors .
For any sufficiently large real number , the interval contains at least one integer having at most two prime factors .
For positive integers m, U and V, we obtain an asymptotic formula for the number of integer points (u,v) ∈ [1,U] × [1,V] which belong to the modular hyperbola uv ≡ 1 (mod m) and also have gcd(u,v) =1, which are also known as primitive points. Such points have a nice geometric interpretation as points on the modular hyperbola which are "visible" from the origin.