Home › TS Intermediate 1st Year › Mathematics › Binomial Theorem › The sought rule avoids writing which rows of Pas…
The sought rule avoids writing which rows of Pascal's triangle?
AAll empty rows
BAll entered rows
CAll earlier rows
DAll equal rows
Answer & Solution
Correct answer: C. All earlier rows
1. Reaching one row by the triangle needs everything above it.
2. A formula would jump straight to the row wanted.
3. The rule helps find the expansion without writing all the rows that come before the desired index.
4. So the answer is all earlier rows.
_Source: NCERT Class XI Mathematics, Ch 7 'Binomial Theorem'_
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?