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 f(n)−g(n)=c, where f and g are multiplicative functions and c is a constant. More precisely, we prove that the number of solutions does not exceed c1−epsilon when f,g and solutions n satisfy some certain constraints, such as f(n)>g(n) for n>1. In particular, we will prove the following estimate: the number of solutions to the equation n−varphi(n)=c is: G(c + 1) + O(c^{0.75 + o(1)}), where G(k) is the number of ways to represent k as a sum of two primes. This result is based on some properties of configurations of points and lines.












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)