On the distribution of φ(σ(n))
Abstract
Let φ(n) be the Euler totient function and σ(n) denote the sum of divisors of n. In this note, we obtain explicit upper bounds on the number of positive integers n≤ x such that φ(σ(n)) > cn for any c>0. This is a refinement of a result of Alaoglu and Erdos.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.