Answers are grounded in this paper and cite their sources.
For a set A⊆ N and n∈ N, let RA(n) denote the number of ordered pairs (a,a’)∈ A× A such that $a+a’=n$. The celebrated Erdős–Turán conjecture says that if RA(n)≥ 1 for all sufficiently large integers $n
No takes yet. Share an insight, caveat, or question.
Sándor et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: