On the Asymptotic Density of a GCD-based Map

TL;DR

This paper investigates the asymptotic density of solutions to a gcd-based map, revealing symmetry properties, solution structures, and explicit density calculations for specific cases.

Contribution

It introduces a uniform parameterization of solutions to the gcd map and computes explicit asymptotic densities, connecting to arithmetic progressions and the Chinese remainder theorem.

Findings

Density of pairs with f(a,b)=1 tends to approximately 0.88151.

Solutions to f(a,b)=n can be described using three parameters and CRT.

Higher-order analogue f_r has a limiting density of 6/π^2 for r≥2.

Abstract

We show that the symmetry of \[f\left(a,b\right)=\frac{\operatorname{gcd}\left(ab,a+b\right)}{\operatorname{gcd}\left(a,b\right)}\] stems from an $\operatorname{SL}_2\left(\mathbb{Z}\right)$ action on primitive pairs and that all solutions to $f\left(a,b\right)=n$ admit a uniform three-parameter description -- recovering arithmetic-progression families via the Chinese remainder theorem when $n$ is squarefree. It shows that the density of pairs with $f\left(a,b\right)=1$ tends to $\prod_p\left(1-p^{-2}(p+1)^{-1}\right)\approx0.88151$, and that its higher-order analogue $f_r$ has a limiting density $6/\pi^2$ for $r\ge2$.