# Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.

## Answer

**Answers can be viewed only if**

- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.

Erdos

4.5K

The answer is accepted.

Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.

- answered
- 373 views
- $3.00

### Related Questions

- Advanced Modeling Scenario
- If both $n$ and $\sqrt{n^2+204n}$ are positive integers, find the maximum value of $𝑛$.
- Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that $f(2n)+2f(2m)=f(f(n+m))$, $\forall m,n\in \mathbb{Z}$
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- There is always a player such that every other player was either beaten by him or beaten by a player beaten by him
- Two persons with the same number of acquaintance in a party
- Elementary num theory Q: or
- Is it possible to transform $f(x)=x^2+4x+3$ into $g(x)=x^2+10x+9$ by the given sequence of transformations?