← All problems

Erdős Problem #1145 — Representations in Asymptotically Equivalent Sets

1 year old · traced to

Let N={1,2,3,…}\mathbb N=\{1,2,3,\ldots\}. Let A,B⊆NA,B\subseteq\mathbb N be infinite, with increasing enumerations A={a1<a2<⋯ }A=\{a_1<a_2<\cdots\} and B={b1<b2<⋯ }B=\{b_1<b_2<\cdots\} satisfying

lim⁡k→∞akbk=1.\lim_{k\to\infty}\frac{a_k}{b_k}=1.

Assume that A+BA+B contains every sufficiently large positive integer; that is, there is an m0∈Nm_0\in\mathbb N such that for every m≥m0m\ge m_0 there are a∈Aa\in A and b∈Bb\in B with a+b=ma+b=m. For n∈Nn\in\mathbb N, define the ordered representation count

rA,B(n)=#{(a,b)∈A×B:a+b=n}.r_{A,B}(n)=\#\{(a,b)\in A\times B:a+b=n\}.

Must these hypotheses imply

lim sup⁡n→∞rA,B(n)=∞?\limsup_{n\to\infty}r_{A,B}(n)=\infty?

Erdős Problems #1145 Erdős–Sárközy, problem 1.17

Background

This is presented as a conjecture of Erdős and Sárközy and appears as their problem 1.17 in a collection of additive-number-theory problems. Its setting is a two-set analogue of the classical additive-basis problem: instead of representing integers as sums of two elements of one set, it asks about sums with one summand from each of two sets, whose increasing enumerations are asymptotically equivalent. The representation count here counts ordered pairs from A×BA\times B. Erdős Problems #1145 Erdős–Sárközy, problem 1.17

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.