There are 21000 - 1 combinations. Remember that in a combination the order of the numbers does not matter. That is relevant only for permutations which are not the same thing. For each combination, each one of the 1000 numbers can be in or out. So for each combination there are 1000 choices of in or out. Except that if all are out, you get a null combination - that is, a combination with no numbers. For that particular case you subtract the 1 from the total. You will have 1 combination consisting of 1000 numbers, 499500 of 2 numbers and so on. The number of combinations will be the nth row of Pascal's triangle.
Take each row and convert it into a column. The first row becomes the first column, the second row, the second column, etc.
true
by 2 rows
8 rows of 6 students 6 rows of 8 students 4 rows of 12 students 3 rows of 16 students 2 rows of 24 students 1 row of 48 students
Each element of a row of pascal's triangle is the sum of the two elements above it. Therefore when you some the elements of a row, each of the elements of the row above are being summed twice. Thus the sum of each row of pascal's triangle is twice the sum of the previous row.
The Fifth row of Pascal's triangle has 1,4,6,4,1. The sum is 16.
The sum of the numbers in each row of Pascal's triangle is twice the sum of the previous row. Perhaps you can work it out from there. (Basically, you should use powers of 2.)
The sum of the numbers on the fifteenth row of Pascal's triangle is 215 = 32768.
No. It's n^2
When evaluating row n+1 of Pascal's triangle, each number from row n is used twice: each number from row ncontributes to the two numbers diagonally below it, to its left and right. From this it is easily seen that the sum total of row n+1 is twice that of row n. The first row of Pascal's triangle, containing only the single '1', is considered to be row zero. Its total, 1, is given by 20. From the above observations, we can conclude that the total of row n is given by 2n. For the eleventh row: 211 = 2048.
7
the horizontal sums doubles each time the sum of row 1 = 1 row 2= 2 row 3 = 4 row 4 = 8 row 5 = 16 etc etc.......... the horizontal sums doubles each time the sum of row 1 = 1 row 2= 2 row 3 = 4 row 4 = 8 row 5 = 16 etc etc..........
If the top row of Pascal's triangle is "1 1", then the nth row of Pascals triangle consists of the coefficients of x in the expansion of (1 + x)n.
1,429,144,287,220
64
4