Let F(N) be the size of the largest Sidon subset of 1,…,N. Is it true that for every k≥ 1 we have F(N+k)≤ F(N)+1 for all sufficiently large N?

Erdős Problem #155 — Let $F(N)$ be the size of the largest Sidon subset of $\{1,\ldots,N\}$ . Is it true that for every $k\geq 1$ we have $F(N+k)\leq F(N)+1$ for all sufficiently large $N$ ?

About 1 year old · traced to 2025

Let $F(N)$ be the size of the largest Sidon subset of $\{1,\ldots,N\}$ . Is it true that for every $k\geq 1$ we have $F(N+k)\leq F(N)+1$ for all sufficiently large $N$ ?

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

additive-combinatorics sidon-sets

InErdős Problems

Posted 1 month ago · edited 3 weeks ago

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.

No solutions have been posted yet.