Prove that one of $(n+1)$ numbers chosen from $\{1,2, \dots, 2n\}$ is divisible by another.
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

4.8K
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 912 views
- $3.00
Related Questions
- 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}$
- Elementary num theory Q: or
- Numbers Theory
- 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
- Why even/odd coordinates correspond to positive/negative signs in elliptic curves
- Is it possible to transform $f(x)=x^2+4x+3$ into $g(x)=x^2+10x+9$ by the given sequence of transformations?