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).\]

The best solution was submitted by 김유준 (KAIST 수리과학과 20학번, +4). Congratulations!

Here is the best solution of problem 2022-17.

Other solutions were submitted by 김기수 (KAIST 수리과학과 18학번, +3), 기영인 (KAIST 22학번, +3), 이준환 (한국외국어대학교 통계학과 19학번, +3), 오준혁 (KAIST 수리과학과 20학번, +3), 신준범 (컬럼비아 대학교 20학번, +3), 이한스 (KAIST 수리과학과 20학번, +3), Kawano Ren (Kaisei Senior High School, +3), Sakae Fujimoto (Osaka Prefectural Kitano High School, Freshmen, +3).