Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2015-part-04 — 191 problems (EN–VI) Question 125

Math Olympiad Vault · MathNet 2015-part-04 — 191 problems (EN–VI)

Question 125

Consider $n$ positive, not necessarily distinct, integers $a_1, a_2, \dots, a_n$ whose sum is $2S$. A positive integer $k$ is called a separator if one can choose $k$ indexes from $\{1, 2, \dots, n\}$ such that the sum of the corresponding numbers is $S$. What is the maximum possible number of separators?