Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
For and every ,
Every nonempty fibre has a unique finite prime support, and its mass is . Equality in (1) occurs at and , corresponding to and .
Proof. For any finite support ,
If its largest prime is at least five, cannot divide any numerator factor with . The only possible equality would make an even integer greater than two. Also every prime factor of is less than : for odd , it is at most , and the factor from is three. Thus is exactly the largest prime of the reduced denominator. Remove its factor and continue with a smaller support.
If the reduced denominator has no prime at least five, no support prime at least five can remain. The four possible supports and their ratios are exactly
Their ratios are distinct. This supplies a unique base case for the descent, including the reduced denominator one at . Consequently any ratio having a solution determines exactly one support. All positive exponent choices on that support give the same ratio, and no other integer does. Summing their reciprocals as in Lemma 2.1 gives the claimed product. Each factor is at most one; equality forces the support to be empty or just . Empty fibers contribute zero.
This supplies the finite case analysis and the induction left to the reader in source Remark 4.7. In particular, the cancellation at is retained rather than silently using the totient base case.
Source. Tao, published paper, published pp.818–819, Remark 4.7. This page uses that published version.
Bears on. Problem 49.