Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 155

../


Statement. Let F(N)F(N) be the size of the largest Sidon subset of {1,…,N}\{1,\ldots,N\}. Is it true that for every k≥1k\geq 1 we have

F(N+k)≤F(N)+1F(N+k)\leq F(N)+1

for all sufficiently large NN?

Status. Open.

Source. erdosproblems.com/155, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #155, https://www.erdosproblems.com/155.

Formalization. Statement in formal-conjectures.

Progress

Not yet compiled.

Known Results

Not yet compiled.