I'm having a hard time visualizing how to prove the following by induction:
For every positive integer $n$, let $[n]$ denote the set $\{1,\ldots,n\}$.
Let $A$ be a set. Use the notation $P(A)$ to indicate the power set of $A$, which consists of all subsets of $A$. For example, if $A=\{0,1\}$, then $P(A)=\big\{\{\},\{0\},\{1\},\{0,1\}\big\}$. Consider $Q(n) = P\big(\{1,\ldots,n\}\big)-\big\{\{\}\big\}$ and use an inductive argument to show that the sum
$$\sum_{S\in Q(n)}\frac1{\prod S}=n\;.$$
For example, the expansion for $n=3$ is
$$\frac11+\frac12+\frac13+\frac1{1\cdot2}+\frac1{1\cdot3}+\frac1{2\cdot3}+\frac1{1\cdot2\cdot3}=3\;.$$