Answers are grounded in this paper and cite their sources.
We give a simple common proof to recent results by Dombi and by Chen and Wang concerning the number of representations of an integer in the form a₁+a₂, where a₁ and a₂ are elements of a given infinite set of integers. Considering the similar problem for differences, we show that there exists a partition N=∪ₖ₌₁^∞ Aₖ of the set of positive integers such that each Aₖ is a perfect difference set (meaning that any non-zero integer has a unique representation as a₁-a₂ with a₁,a₂∈ Aₖ). A number of open problems are presented.
No takes yet. Share an insight, caveat, or question.
Vsevolod F. Lev (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: