Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Let be rational in lowest terms. If some positive integer satisfies , then all such have the same finite prime support , and
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,
If , then forces , and every nonempty support would make (2) strictly smaller than one. Thus and is empty.
Suppose . If is the largest prime divisor of , the denominator in (2) contains exactly once before reduction. No numerator with is divisible by , so survives in the reduced denominator. No prime larger than can divide that denominator. Therefore is exactly the largest prime divisor of . Removing from the support replaces by , and the largest support prime strictly decreases. Induction, terminating at the empty support, determines uniquely. Conversely, all integers whose support is this satisfy (2), regardless of the positive exponents of their prime factors.
Summing those exponents by positive geometric series proves
Each factor is at most one, proving the bound.
Source. Tao, published paper, published pp.799–800, Lemma 2.1. This page uses that published version.
Bears on. Problem 49.