The number of solution of φ (cursive Greek chi) = m

Research output: Contribution to journalArticlepeer-review


An old conjecture of Sierpiński asserts that for every integer k ≥ 2, there is a number m for which the equation φ(cursive Greek chi) = 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.

Original languageEnglish (US)
Pages (from-to)283-311
Number of pages29
JournalAnnals of Mathematics
Issue number1
StatePublished - Jul 1999
Externally publishedYes

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'The number of solution of φ (cursive Greek chi) = m'. Together they form a unique fingerprint.

Cite this