Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Fang 2017 quantitative form erdos birch theorem
J.-H. Fang and Y.-G. Chen, A quantitative form of the Erdős–Birch theorem, Acta Arith. 178 (2017), no. 4, 301--311; DOI 10.4064/aa8434-10-2016. Received 5 February 2016, revised 12 August 2016, published online 10 May 2017. 2010 MSC 11A07, 11B13.
The retained folder-name PDF is the publisher's (Instytut Matematyczny PAN) PDF of the eleven printed pages 301--311 (PDF p. is printed p. ) followed by one blank page (PDF p. 12), with a text layer; p. 301 was also read on the page image for the towers of exponents. Provenance: retained from the repository's survey download set of September 2026; the survey record identifies the source by the DOI 10.4064/aa8434-10-2016 (https://doi.org/10.4064/aa8434-10-2016), which the first page also prints, and the download URL itself was not recorded; 274,296 bytes. The file prints "© Instytut Matematyczny PAN, 2017" on printed p. 301; IMPAN's article record offers the PDF under the link "Pobierz zgodnie z CC-BY" (which the English site renders "Free download under CC-BY license"), no version named (https://www.impan.pl/get/doi/10.4064/aa8434-10-2016, read 2026-10-02), and that page grant decides over the printed line: the Creative Commons Attribution license without a version; the site footer "Copyright © 2026 by IMPAN. All rights reserved." is the website's, not the article's.
Read status: claims checked for Theorem 1.1, whose statement was read clause by clause in the text layer; its proof was read but not verified; the problem page does not yet consume any statement from this source.
Contents
- Theorem A (p. 301; Birch 1959, the problem's [Bi59]): if are coprime, then some integer has the property that each equals a sum over pairwise distinct pairs of nonnegative integers. Cassels 1960 ([Ca60]) proved a more general theorem. Davenport observed that for some the sequence is already complete; is the least such .
- Earlier bounds (p. 301; read on the page image): Hegyvári 2000 ([He00b]) gave with , improved by Chen and Fang 2012 and Fang 2011 to .
- Theorem 1.1 (pp. 301--302; proof in section 2, pp. 302--311): "For any coprime integers , there exist positive integers and with
such that every integer can be expressed as the sum of distinct terms taken from ." Statement checked in the text layer and on the page images of pp. 301--302.
- Remark (p. 302): Bergelson and Simmons 2017 proved , but their method seems not to give an explicit ; the authors cannot prove Theorem 1.1 with .
- Method (pp. 302--311): a pigeonhole lemma (Lemma 2.1) producing disjoint nonempty with equal weighted sums ; a gap bound for subset sums (Lemmas 2.2, 2.3, Corollary 2.4: consecutive subset sums of ${p^aq^{2b}:a\ge0,\ 0\le b\le p}$ differ by less than ); the doubly exponential recursion (Lemma 2.5); the key Lemma 2.6, an with a subset sum of for every ; and Vu's lemma (Lemma 2.7) that the subset sums of integers coprime to cover every residue modulo .
Compiled scope
The whole paper (printed pp. 301--311) was read in the text layer, with pp. 301--302 also on the page images. The statement of Theorem 1.1 was checked clause by clause; the proof was read but not verified. Nothing here is independently reviewed.
Bears on. #246, as the effective form of Birch's theorem, which settles the problem: it bounds the threshold beyond which every integer is a sum of distinct and the range of exponents of that suffices, both by explicit towers in and .