Erdős Problem #1211 — Logarithmic density of subset sums in a two-colouring

About 44 years old · traced to

Partition N=A⊔BN=A⊔B, and let S(A)S(A) and S(B)S(B) be the sets of finite sums of distinct elements of AA and BB. If δ‾log⁡(X)=lim sup⁡x→∞(1/log⁡x)∑n<x,n∈X1/n\overline δ_{\log}(X)=\limsup_{x→∞}(1/\log x)\sum_{n<x,n∈X}1/n, how small can max⁡{δ‾log⁡(S(A)),δ‾log⁡(S(B))}\max\{\overline δ_{\log}(S(A)),\overline δ_{\log}(S(B))\} be?

References

Additional references

P. Erdős, Some new problems and results in number theory, in Number Theory (Mysore, 1981), Lecture Notes in Mathematics 938 (1982), 50–74.

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.