Arithmetic functions and their coprimality (Q644306)

Various authors have investigated the quantity \(S(x)= \#\{n\leq x: \gcd(f(n),g(n))= 1\}\) for certain arithmetic functions \(f\), \(g\). In [Publ. Math. 66, No. 1--2, 121--128 (2005; Zbl 1072.11054)] the present authors estimated \(S(x)\) when \(f\) is the product of Euler's function \(\varphi\) and the sum of divisors function \(\sigma\), and \(g(n)\) is the number \(\tau(n)\) of divisors of n\(.\) In their current paper they consider \(f,g: \mathbb N\to\mathbb N\) when \(f(p)= D\), \(g(p)= p+ l\) for each prime \(p\) where \(D\geq 3\) is odd, \(l\geq -1\) and nonzero, and \((l,D)= 1\). They then prove in Theorem 2.1 that \(S(x)= (c + o(1))x(\log x)^{\tau-1}\) where \(c>0\) is a constant and \(\tau={T\over\varphi(D)}\) with \(T\) the number of reduced residue classes \(t\) modulo \(D\) such that \((t+ l,D)= 1\). For the same functions \(f\), \(g\) with \(D>3\) and prime, they estimate in Theorem 2.2 the number of integers \(n\leq x\) for which \(\gcd(g(n), f(n- 1))= 1\). The proofs make use of Wirsing's Theorem and its extension due to Levin and Fainleib.