Pascal's triangle gives, for index n, the row
AⁿC_0, ⁿC_1, …, ⁿC_n
Bn, n − 1, n − 2, …, 0
C1, 2, 3, …, n
D0, 1, 2, …, n − 1
Answer & Solution
Correct answer: A. ⁿC_0, ⁿC_1, …, ⁿC_n
Row n of Pascal's triangle is ⁿC_0, ⁿC_1, …, ⁿC_n — the same coefficients that appear in the binomial expansion of (a + b)^n.
Related questions
In the expansion of a bracket raised to four, the sum of indices is:How many terms are in the expansion of a bracket raised to twelve?How many terms are in the expansion of a bracket raised to five?In the last term of the expansion, the index of b is:In the first term of the expansion, the index of b is:In the first term of the expansion, the index of a is:The general rule for expansion is built using the concept of:Why is Pascal's triangle awkward for a large index?