What is ( 0 2 0 ) + ( 1 2 0 ) + ( 2 2 0 ) + ( 3 2 0 ) + . . . . + ( 1 9 2 0 ) + ( 2 0 2 0 ) ?
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.
Explain the 2 n part. How did you get it?
Log in to reply
Simple. Each "choose" corresponds to a row of Pascal's Triangle. If there are 21 elements, we go to the 2 0 t h row of Pascal's Triangle.
METHOD 1: Consider the expansion of ( 1 + x ) n = ( 0 n ) + ( 1 n ) + . . . + ( n − 1 n ) x n − 1 + ( n n ) x n
When x=1, n=20
( 0 2 0 ) + ( 1 2 0 ) + . . . + ( 1 9 2 0 ) + ( 2 0 2 0 ) = 2 2 0
METHOD 2: Consider twenty boxes and twenty toys which are to be distributed among them, with the constraint that each box can contain at most 1 toy. Then we can choose the boxes in which we place the toys in ( 0 2 0 ) + ( 1 2 0 ) + ( 2 2 0 ) + ( 3 2 0 ) + . . . . + ( 1 9 2 0 ) + ( 2 0 2 0 ) ways. Now, for any given box, the toy can be either in it or not, giving us 2 possibilities and by the multiplicative principle, for 20 boxes, the possibilities become 2 2 0 . Also, the number of possibilities arrived at by two different ways must be equal(assuming we reasoned correctly)
Hence, ( 0 2 0 ) + ( 1 2 0 ) + ( 2 2 0 ) + ( 3 2 0 ) + . . . . + ( 1 9 2 0 ) + ( 2 0 2 0 ) = 2 2 0
Simple standard approach.
Problem Loading...
Note Loading...
Set Loading...
Sum of elements = 2 n
In this case, n = 2 0
2 2 0 = 1 0 4 8 5 7 6