Erdős Problem #1145 — Representations in Asymptotically Equivalent Sets
Let . Let be infinite, with increasing enumerations and satisfying
Assume that contains every sufficiently large positive integer; that is, there is an such that for every there are and with . For , define the ordered representation count
Must these hypotheses imply
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 . Erdős Problems #1145 Erdős–Sárközy, problem 1.17
Progress summary
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.