Wiki
Wiki

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. nn is printed p. n+300n+300) 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 p,q>1p,q>1 are coprime, then some integer BB has the property that each n≥Bn\ge B equals a sum pa1qb1+⋯+pakqbkp^{a_1}q^{b_1}+\dots+p^{a_k}q^{b_k} over pairwise distinct pairs (ai,bi)(a_i,b_i) of nonnegative integers. Cassels 1960 ([Ca60]) proved a more general theorem. Davenport observed that for some KK the sequence YK={paqb:a≥0, 0≤b≤K}Y_K=\{p^aq^b:a\ge0,\ 0\le b\le K\} is already complete; K(p,q)K(p,q) is the least such KK.
  • Earlier bounds (p. 301; read on the page image): Hegyvári 2000 ([He00b]) gave K(p,q)≤2p2d22q4p+3K(p,q)\le2p^{2d^{2^{2q^{4p+3}}}} with d=1152log⁡2plog⁡2qd=1152\log_2p\log_2q, improved by Chen and Fang 2012 and Fang 2011 to K(p,q)≤d2q2p+3K(p,q)\le d^{2^{q^{2p+3}}}.
  • Theorem 1.1 (pp. 301--302; proof in section 2, pp. 302--311): "For any coprime integers p,q>1p,q>1, there exist positive integers KK and BB with
log⁡2log⁡2K<q2p,log⁡2log⁡2log⁡2B<q2p\log_2\log_2K<q^{2p},\qquad \log_2\log_2\log_2B<q^{2p}

such that every integer n≥Bn\ge B can be expressed as the sum of distinct terms taken from {paqb∣a≥0, 0≤b≤K, a+b>0, a,b∈Z}\{p^aq^b\mid a\ge0,\ 0\le b\le K,\ a+b>0,\ a,b\in\mathbb Z\}." Statement checked in the text layer and on the page images of pp. 301--302.

  • Remark (p. 302): Bergelson and Simmons 2017 proved K(p,q)≤4p−5K(p,q)\le4p-5, but their method seems not to give an explicit BB; the authors cannot prove Theorem 1.1 with K=4p−5K=4p-5.
  • Method (pp. 302--311): a pigeonhole lemma (Lemma 2.1) producing disjoint nonempty E1,E2⊆[1,4log⁡2q]×[1,4log⁡2p]E_1,E_2\subseteq[1,4\log_2q]\times[1,4\log_2p] with equal weighted sums ∑paqb\sum p^aq^b; 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 q2p−q2p−2q^{2p}-q^{2p-2}); the doubly exponential recursion Un,VnU_n,V_n (Lemma 2.5); the key Lemma 2.6, an R≤WpUqVR\le Wp^Uq^V with mpUqV+Rmp^Uq^V+R a subset sum of {paq2b+1}\{p^aq^{2b+1}\} for every m≥0m\ge0; and Vu's lemma (Lemma 2.7) that the subset sums of mm integers coprime to mm cover every residue modulo mm.

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 BB beyond which every integer is a sum of distinct akbla^kb^l and the range KK of exponents of bb that suffices, both by explicit towers in aa and bb.