Question 3
Determine all positive integers $k$ for which there exist a positive integer $m$ and a set $S$ of positive integers such that any integer $n\gt m$ can be written as a sum of distinct elements of $S$ in exactly $k$ ways.
Math Olympiad Vault · MathNet 2020 — Math Olympiad Vault — Part 01