On differences of multiplicative functions and solutions of the equation n-(n)=c
From MaRDI portal
Publication:2037708
Abstract: We will study the solutions to the equation , where and are multiplicative functions and is a constant. More precisely, we prove that the number of solutions does not exceed when and solutions satisfy some certain constraints, such as for . In particular, we will prove the following estimate: the number of solutions to the equation is: G(c + 1) + O(c^{0.75 + o(1)}), where is the number of ways to represent as a sum of two primes. This result is based on some properties of configurations of points and lines.
Recommendations
Cited in
(2)
This page was built for publication: On differences of multiplicative functions and solutions of the equation \(n-\varphi(n)=c\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037708)