Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Let q=a/b>0q=a/b>0 be rational in lowest terms. If some positive integer dd satisfies φ(d)/d=q\varphi(d)/d=q, then all such dd have the same finite prime support PP, and

∑φ(d)/d=q1d=∏p∈P1p−1.(1)\sum_{\varphi(d)/d=q}\frac1d=\prod_{p\in P}\frac1{p-1}. \tag{1}

If the fibre is empty its mass is zero. In particular the mass is at most one, which is Proposition 1.4.

Proof. For any solution,

q=∏p∣dp−1p.(2)q=\prod_{p\mid d}\frac{p-1}{p}. \tag{2}

If b=1b=1, then 0<q≤10<q\le1 forces q=1q=1, and every nonempty support would make (2) strictly smaller than one. Thus d=1d=1 and PP is empty.

Suppose b>1b>1. If rr is the largest prime divisor of dd, the denominator in (2) contains rr exactly once before reduction. No numerator p−1p-1 with p≤rp\le r is divisible by rr, so rr survives in the reduced denominator. No prime larger than rr can divide that denominator. Therefore rr is exactly the largest prime divisor of bb. Removing rr from the support replaces qq by qr/(r−1)qr/(r-1), and the largest support prime strictly decreases. Induction, terminating at the empty support, determines PP uniquely. Conversely, all integers whose support is this PP satisfy (2), regardless of the positive exponents of their prime factors.

Summing those exponents by positive geometric series proves

∑supp⁡(d)=P1d=∏p∈P∑j≥1p−j=∏p∈P1p−1.\sum_{\operatorname{supp}(d)=P}\frac1d =\prod_{p\in P}\sum_{j\ge1}p^{-j} =\prod_{p\in P}\frac1{p-1}.

Each factor is at most one, proving the bound. □\square

Source. Tao, published paper, published pp.799–800, Lemma 2.1. This page uses that published version.

Bears on. Problem 49.