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
- 950 views
- $3.00
Related Questions
- Solve $x^{83}\equiv 7\pmod {139}$
- Elementary group theory and number theory questions involving prime numbers, permutation groups and dihedral groups. Introduction to number theory questions
- 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}$
- $2n$ ambassador seating around a round table so that no one seats next to an enemy
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
- 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