The number of solutions of \(\varphi (x)=m\) (Q1808862): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q165886
Property / reviewed by
 
Property / reviewed by: Andrew Granville / rank
Normal rank
 

Revision as of 00:14, 10 February 2024

scientific article
Language Label Description Also known as
English
The number of solutions of \(\varphi (x)=m\)
scientific article

    Statements

    The number of solutions of \(\varphi (x)=m\) (English)
    0 references
    0 references
    31 January 2000
    0 references
    Let \(A(m)\) denote the number of integers \(n\) for which \(\varphi(n)=m\), let \(V_k(x)\) denote the number of \(m\leq x\) for which \(A(m)=k\) and let \(V(x)=\sum_{k\geq 1} V_k(x)\). Carmichael conjectured that \(A(m)\neq 1\) for all \(m\) (that is, \(V_1(x)=0\)); Sierpiński conjectured that for every integer \(k\geq 2\), there does exist \(m\) with \(A(m)=k\). In this delightful paper, Ford proves Sierpiński's long elusive conjecture, even proving the surprising result that \(V_k(x)\gg_k V(x)\) for \(x>x_k\), whenever \(k\geq 2\). He had already proved extraordinarily strong estimates for \(V(x)\) in [Ramanujan J. 2, 67-151 (1998; Zbl 0914.11053)]. The author and \textit{S. Konyagin} [Number Theory in Progress, Vol. 2, 795-803 (1999; Zbl 0931.11032)] had already proved Sierpiński's conjecture for even \(k\), but the odd \(k\) case seems to be considerably more difficult. The starting point for Ford's method is an easy proof of Sierpiński's conjecture under the assumption of the prime triplets conjecture; for if \(A(m)=k\) and \(p\) is a large prime such that \(dp+1\) is prime for \(d\) dividing \(2m\) only when \(d=2\) or \(2m\), then \(A(2mp)=k+2\). Of course we do not know whether the prime triplets conjecture is true, but we do know, from sieve methods, that we can determine \(k\)-tuples of ``almost primes'', that is integers with few and only large prime factors. Thus Ford suitably modifies the above construction to incorporate such \(k\)-tuples. This requires considerable ingenuity and technical progress, making this proof an impressive achievement.
    0 references
    Sierpiński conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references