@MISC{Ford_thenumber, author = {Kevin Ford}, title = {The number of solutions of Φ(x) = m}, year = {} }

Bookmark

OpenURL

Abstract

An old conjecture of Sierpiński asserts that for every integer k � 2, there is a number m for which the equation φ(x) = m has exactly k solutions. Here φ is Euler’s totient function. In 1961, Schinzel deduced this conjecture from his Hypothesis H. The purpose of this paper is to present an unconditional proof of Sierpiński’s conjecture. The proof uses many results from sieve theory, in particular the famous theorem of Chen.