There are $3N+1$ students with different heights line up for asking questions. Prove that the teacher can drive $2N$ students away such that the remain students satisfies: No one has neighbors whose heights are consecutive.
Source: IMOC 2017 C4
Tags: combinatorics
There are $3N+1$ students with different heights line up for asking questions. Prove that the teacher can drive $2N$ students away such that the remain students satisfies: No one has neighbors whose heights are consecutive.