TL;DR: In this paper, it was shown that if n is a solution of (1), then n is either a prime or the product of seven or more distinct primes, and the proof of the nonexistence of composite solutions of this problem seems about as remote as the proof for the existence of odd perfect numbers.
Abstract: where k is an integer, and {n) is Euler's totient function, giving the number of integers (n) divides n — 1. We have not been able to establish this, however. The proof of the nonexistence of composite solutions of (1) seems about as remote as the proof of the nonexistence of odd perfect numbers and the two problems though not equivalent are not dissimilar. Let w b e a composite solution of (1) and let a be any number prime to n\\ then
TL;DR: In this article, the average and 0-type theorems for the error function EQ(x) were sharpened for the Euler totient function, where A > 0 and B are constants.
Abstract: Let (n) denote the Euler totient function. In 1900, E. Landau proved that Tinzx l/^(/i) = ̂ (log x + B) + E0(x) where A > 0 and B are constants and E0(x) — 0(log x/x). In an earlier paper, we sharpened this result and in the present paper prove, in particular, some average and 0-type theorems for the error function EQ(x).