Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 325

../

claims/: The 1 claim page of Problem 325, one per claimant's result; the problem's standing derives from them.


Statement. Let k≥3k\geq 3 and fk,3(x)f_{k,3}(x) denote the number of integers ≤x\leq x which are the sum of three nonnegative kkth powers. Is it true that

fk,3(x)≫x3/kf_{k,3}(x) \gg x^{3/k}

or even ≫ϵx3/k−ϵ\gg_\epsilon x^{3/k-\epsilon}?

Status. Open: the site's label (OPEN). Comments on the site's discussion thread of 2026-03-09 cite Browning and Heath-Brown, whose corollary settles every k≥33k\ge33 (claim page); the paper does not cover 3≤k≤323\le k\le32.

Source. erdosproblems.com/325, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #325, https://www.erdosproblems.com/325.

References.

  • [ErMa38] Erdős, Pál and Mahler, Kurt, On the number of integers which can be represented by a binary form. Doc. Math. (2019), 475-481.
  • [Wo15] Wooley, Trevor D., Sums of three cubes, II. Acta Arith. (2015), 73-100.

Formalization. Statement in formal-conjectures.

Current assessment

The standing is derived from the claim page in claims/: the problem is open, with one accepted partial claim. Browning and Heath-Brown's Corollary (Invent. Math. 2004), recorded on its claim page, gives for every k≥33k\ge33 asymptotically 16cx3/k\tfrac16cx^{3/k} integers n≤xn\le x that are sums of three kkth powers, with c=Γ(1+1/k)3/Γ(1+3/k)c=\Gamma(1+1/k)^3/\Gamma(1+3/k), so fk,3(x)≫x3/kf_{k,3}(x)\gg x^{3/k} and both forms of the question hold in that range; the corollary rests on their count of o(B3)o(B^3) non-trivial solutions of x1k+x2k+x3k=x4k+x5k+x6kx_1^k+x_2^k+x_3^k=x_4^k+x_5^k+x_6^k with max⁡xi≤B\max x_i\le B for k≥33k\ge33. For k=3k=3 the site's record is Wooley's Theorem 1.1 [Wo15], f3,3(x)≫x0.91709477f_{3,3}(x)\gg x^{0.91709477} for sums of three positive cubes (source card), short of the exponent 11 the question asks for. The two-power analogue is Mahler and Erdős's theorem [ErMa38], which the site records as fk,2(x)≫x2/kf_{k,2}(x)\gg x^{2/k} for every k≥3k\ge3: an integral binary form of degree k≥3k\ge3 with nonzero discriminant represents ≫u2/k\gg u^{2/k} integers up to uu (source card); since zero is allowed as a summand, fk,3(x)≥fk,2(x)f_{k,3}(x)\ge f_{k,2}(x). For 4≤k≤324\le k\le32 no result beyond fk,3(x)≫x2/kf_{k,3}(x)\gg x^{2/k} is recorded, and later work that may extend Browning and Heath-Brown's range below 3333 is not assessed.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.