Wiki
Wiki

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

Updated


Claim. Let ANA_N be a set of nonnegative integers such that every n≤Nn\le N is a+bka+b^k with a∈ANa\in A_N and bb a positive integer. Theorem 1 of Cilleruelo's paper gives

∣AN∣≥N1−1/k(1Γ(2−1/k) Γ(1+1/k)+o(1)),\lvert A_N\rvert\ge N^{1-1/k}\left(\frac{1}{\Gamma(2-1/k)\,\Gamma(1+1/k)}+o(1)\right),

and for k=2k=2 the constant is 4/π=1.2732…4/\pi=1.2732\ldots. If AA is an additive complement of the squares in the sense of Problem 33, so that every integer beyond some n0n_0 is n2+an^2+a with a∈Aa\in A, then every integer up to any NN is n2+an^2+a with n≥0n\ge0 and aa in AA or in {0,…,n0}\{0,\ldots,n_0\}. Theorem 1 asks for b≥1b\ge1, and a member of AA whose only representation is a+02a+0^2 is not covered, so the theorem does not apply verbatim; adding a−1a-1 for each such aa could double the count and give only 2/π2/\pi. The proof applies unchanged: allowing b=0b=0 adds to the inner sum for each aa one term bounded by the maximum of the continuous weight, which the O(1)O(1) error of the paper's Euler-summation lemma (Lemma 2) absorbs. Habsieger's theorem, which allows the square 020^2, gives the same bound directly. The added elements change ∣A∩{1,…,N}∣\lvert A\cap\{1,\ldots,N\}\rvert by at most a constant, so

lim inf⁡N→∞∣A∩{1,…,N}∣N1/2≥4π>1.\liminf_{N\to\infty}\frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}\ge\frac4\pi>1.

This answers the second question of the problem yes. The same bound was proved independently by Habsieger, whose paper notes Cilleruelo's proof in a note added in proof; the first answer, 1.061.06, is Moser's.

Covers. The liminf question (the part liminf), answered yes with the bound 4/π4/\pi. Not covered: the smallest possible limsup, which no source determines; since a limsup is at least the liminf, the bound shows only that the smallest possible limsup is at least 4/π4/\pi.

Depends on. Nothing in this wiki; the claim rests on the cited paper.

Acceptance. Refereed: J. Cilleruelo, The additive completion of kkth powers, J. Number Theory 44 (1993), no. 3, 237–243. The site's curator records the bound in the problem's remarks, but the site labels the problem OPEN, so that remark is not acceptance of the problem and the page lists no reviewed evidence. The edition read is an author-typeset manuscript; its proof is not compiled in this corpus.

Dating. The page is dated by the issue month in the publisher's record, July 1993; the day is a placeholder.