Can you help Phoenix?
Phoenix has 32 cards out of which 10 cards, each of blue, green, and red colors have denominations as::{2,4,8,16,32,64,128,256,512,1024} and 1 black and 1 white card have value unity each. Then the number of ways in which Phoenix can get a sum of 2016 if he can choose any number of cards is?
The answer is 1018081.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
use multinomial theorem to find the coefficient of t^2016.
you can use the concept of "take it or leave it".