Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Fix and . For every sufficiently large prime power and every
each residue modulo is for a subset with . The threshold depends only on , so the statement is uniform in and the residue.
Source: published PDF, Theorem 2, pp. 7–8. The printed statement allows every . This page certifies the complete range used by the paper's absorption theorem; it does not certify the unused larger range. The proof is complete relative to the exact external CFP and divisor inputs, with the restricted modular approximation and proper-dilate reduction explicitly repaired.
Bears on. Problem 297.
Proof
Use the progression, sets, and parameters from gap_symmetrization. If its dimension is at least 2, its volume estimate first gives . Apply the corrected Lemma 4 to its integer steps; they need not individually be units. Then claim_1 gives
On the other hand, . For every fixed these inequalities contradict each other for large , since eventually. Thus the actual dimension is 1.
Now contains a member of coprime to . It follows that is coprime to . Choose to be its inverse modulo and take . The bound required by Claim 1 is valid because . This proves the same volume lower bound for without any assumption .
The proper progression contained in has at least points in an arithmetic progression with step . Since and , this number exceeds for large . Any consecutive terms of a progression with step coprime to give every residue. Every such term is a subset sum of , and . Each element of is the inverse of a distinct element of . Lifting a subset of to those original denominators gives the required subset .