Seven Cards for Each Powers of 2
Source: 2015 Korean Junior MO P3
November 1, 2015
combinatorics
Problem Statement
For all nonnegative integer , there are seven cards with written on it.
How many ways are there to select the cards so that the numbers add up to ?