# On Differences of Multiplicative Functions and Solutions of the Equation $n-\varphi(n) = c$

## TL;DR

This paper investigates solutions to the equation involving multiplicative functions, especially focusing on the difference between n and Euler's totient function, providing bounds and connections to prime sum representations.

## Contribution

It establishes bounds on the number of solutions to f(n) - g(n) = c for multiplicative functions and relates solutions of n - φ(n) = c to prime sum representations.

## Key findings

- Number of solutions does not exceed c^{1-ε} under certain conditions.
- Solutions to n - φ(n) = c are approximately G(c+1), the count of prime sum representations.
- Provides bounds involving prime sums and configurations of points and lines.

## 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 $c^{1-\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.