Is it true that there will always be two among the selected integers so that one of them is equal to twice the other?

Let $n \geq 2$ . Select $n+1$ different integers from the set ${\{1,2,...,2n}\}$. Is it true that there will always be two among the selected integers so that one of them is equal to twice the other?

Is it true that there will always be two among the selected integers so that one is a multiple of the other?

attempt:

The first statement is false. To see this, consider the case when $n=2$. Then we select $3$ different integers from ${\{1,2,3,4}\}$. Choose $1,3,4$, then it does not work.

every number can be written uniquely in the form $2^ak$ so that $k$ is odd.
There are exactly $n$ different possible values of $k$, so by the pigeon-hole principle there exist integers $k,a,b$ such that $2^ak$ and $2^bk$ are both in the subset of selected integers.