MathDB

For a given positive integer

n

, we consider the set

M

of all intervals of the form

[l, r]

, where the integers

l

and

r

satisfy the condition

0 \leq l < r \leq n

. What largest number of elements of

M

can be chosen so that each chosen interval completely contains at most one other selected interval?
Proposed by Anton Trygub

Problem Statement