Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 11). Fix an integer . For an integer , a minimal additive complement of the -th powers up to is a subset of of smallest cardinality such that every integer with is for some and some integer . Its cardinality is , and is the liminf, as , of ; the print writes in this definition where the context calls for .
Theorem (p. 11, unnumbered, quoted). "If, for a in the interval and all large integers , there is a minimal additive complement of the -th powers up to contained in the interval , then one has the following inequality." The inequality, displayed as (20):
The paper calls this the generalization of Theorem 1 to higher powers, says the method of the note adapts easily, and records the statement for completeness; it gives no proof.
Consistency checks (observations of this page, not of the paper). For the right side of (20) is the right side of Theorem 1's inequality (1), since and , the two identities the paper uses on p. 10. As the right side tends to ; as the first term of the denominator tends to and the integral to , so the right side tends to , which is at .
Source. R. Balasubramanian and D. S. Ramana, Additive complements of the squares, C. R. Math. Rep. Acad. Sci. Canada 23 (2001), no. 1, 6-11: Section 5 (Concluding Remarks), p. 11. The edition read is identified on the source card.
Read depth. Claims checked: the setting and the statement were read clause by clause on the printed page. The paper prints no proof, so none was checked. Nothing here is independently reviewed.
Proof pointer
None in the paper. It states (p. 11) that the method used for Theorem 1 adapts easily to -th powers.
Dependencies
The method of Theorem 1 of the same paper.
Bears on
- Problem 33: only through the case , where the statement coincides with Theorem 1, whose page states the relation. The cases concern complements of higher powers, which Problem 33 does not ask about.