Let \(n, i\) be integers such that \(1 \leq i \leq n\). Each subset of \( \{ 1, 2, \ldots, n \} \) with \( i\) elements has the smallest number. We define \( \phi(n,i) \) to be the sum of these smallest numbers. Compute \[ \sum_{i=1}^n \phi(n,i).\]

**GD Star Rating**

*loading...*