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
- 974 views
- $3.00
Related Questions
- Two persons with the same number of acquaintance in a party
- Numbers Theory
- Wierdly Rational Fractions
- Prove that $p^2-1$ is divisible by 24 for any prime number $p > 3$.
- Advanced Modeling Scenario
- Quadratic residue
- Find conditions for all chips to become of the same color in this game
- How many prime numbers (exact) less or equal to n, for one n, where n>=10^40?