Maths Olympiad Prep

Track / Stage 7 / 58 of 300 #1458 of 1964

Problem 1458

National olympiad second round; IMO P1/P4
Combinatorics Difficulty 7.1 Prove it

Prove that 1i1i2ik=n\sum \frac{1}{i_1i_2 \ldots i_k} = n is taken over all non-empty subsets {i1,i2,,ik}\left\{i_1,i_2, \ldots, i_k\right\} of {1,2,,n}\left\{1,2,\ldots,n\right\}. (The kk is not fixed, so we are summing over all the 2n12^n-1 possible nonempty subsets.)

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

To prove the statement, we will use mathematical induction.

1. Base Case:
For n=1 n = 1 , the only non-empty subset of {1}\{1\} is {1}\{1\} itself. Thus, the sum is:
1i1=11=1 \sum \frac{1}{i_1} = \frac{1}{1} = 1
Therefore, the statement holds for n=1 n = 1 .

2. Inductive Step:
Assume the statement is true for n=k n = k . That is, we assume:
{i1,i2,,ij}{1,2,,k}{i1,i2,,ij}1i1i2ij=k \sum_{\substack{\{i_1, i_2, \ldots, i_j\} \subseteq \{1, 2, \ldots, k\} \\ \{i_1, i_2, \ldots, i_j\} \neq \emptyset}} \frac{1}{i_1 i_2 \ldots i_j} = k
We need to show that the statement holds for n=k+1 n = k+1 . Consider the set {1,2,,k+1}\{1, 2, \ldots, k+1\}.

3. **Sum over subsets of {1,2,,k+1}\{1, 2, \ldots, k+1\}:**
The non-empty subsets of {1,2,,k+1}\{1, 2, \ldots, k+1\} can be divided into two categories:
- Subsets that do not contain k+1 k+1
- Subsets that contain k+1 k+1

4. **Subsets that do not contain k+1 k+1 :**
These are exactly the non-empty subsets of {1,2,,k}\{1, 2, \ldots, k\}. By the induction hypothesis, the sum over these subsets is k k .

5. **Subsets that contain k+1 k+1 :**
For a subset S S that contains k+1 k+1 , we can write S=T{k+1} S = T \cup \{k+1\} , where T T is a subset of {1,2,,k}\{1, 2, \ldots, k\}. The sum over these subsets is:
T{1,2,,k}T1(i1i2ij)(k+1)=1k+1T{1,2,,k}T1i1i2ij \sum_{\substack{T \subseteq \{1, 2, \ldots, k\} \\ T \neq \emptyset}} \frac{1}{(i_1 i_2 \ldots i_j)(k+1)} = \frac{1}{k+1} \sum_{\substack{T \subseteq \{1, 2, \ldots, k\} \\ T \neq \emptyset}} \frac{1}{i_1 i_2 \ldots i_j}
By the induction hypothesis, the sum over all non-empty subsets T T of {1,2,,k}\{1, 2, \ldots, k\} is k k . Therefore, the sum over subsets containing k+1 k+1 is:
1k+1k=kk+1 \frac{1}{k+1} \cdot k = \frac{k}{k+1}

6. Combining the sums:
The total sum over all non-empty subsets of {1,2,,k+1}\{1, 2, \ldots, k+1\} is the sum of the two parts:
k+kk+1 k + \frac{k}{k+1}
Simplifying this expression:
k+kk+1=k(k+1)k+1+kk+1=k(k+1)+kk+1=k2+k+kk+1=k2+2kk+1=k(k+2)k+1=k+1 k + \frac{k}{k+1} = \frac{k(k+1)}{k+1} + \frac{k}{k+1} = \frac{k(k+1) + k}{k+1} = \frac{k^2 + k + k}{k+1} = \frac{k^2 + 2k}{k+1} = \frac{k(k+2)}{k+1} = k + 1

Thus, the statement holds for n=k+1 n = k+1 .

By the principle of mathematical induction, the statement is true for all n1 n \geq 1 .

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.