On two conjectures of Sierpi\'nski concerning the arithmetic functions σ and φ
Abstract
Let σ(n) denote the sum of the positive divisors of n. We prove that for any positive integer k, there is a number m for which the equation σ(x)=m has exactly k solutions, settling a conjecture of Sierpi\'nski from 1955. Additionally, it is shown that for every positive even k, there is a number m for which the equation φ(x)=m has exactly k solutions, where φ is Euler's function, making progress toward another conjecture of Sierpi\'nski from 1955.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.