Question
No of terms whose value depend on 'x' is is
- 2n
- 2n+1
- 2n-1
- n+1
The correct answer is: 2n
Related Questions to study
If represent the terms is then is
If represent the terms is then is
Let ' O be the origin and A be a point on the curve then locus of the midpoint of OA is
Let ' O be the origin and A be a point on the curve then locus of the midpoint of OA is
Which one is absent in free state during origin of life ?
Which one is absent in free state during origin of life ?
Two different packs of 52 cards are shuffled together. The number of ways in which a man can be dealt 26 cards so that he does not get two cards of the same suit and same denomination is-
Two different packs of 52 cards are shuffled together. The number of ways in which a man can be dealt 26 cards so that he does not get two cards of the same suit and same denomination is-
In how many ways can 6 prizes be distributed equally among 3 persons?
In combinatorics, the rule of sum or addition principle states that it is the idea that if the complete A ways of doing something and B ways of doing something and B ways of doing something, we cannot do at the same time, then there are (A + B) ways of choosing one of the actions. In this question, there is a possibility that the student might miss considering all the cases. They may forget to consider case 2 and get a different answer.
In how many ways can 6 prizes be distributed equally among 3 persons?
In combinatorics, the rule of sum or addition principle states that it is the idea that if the complete A ways of doing something and B ways of doing something and B ways of doing something, we cannot do at the same time, then there are (A + B) ways of choosing one of the actions. In this question, there is a possibility that the student might miss considering all the cases. They may forget to consider case 2 and get a different answer.
The number of ways in which mn students can be distributed equally among m sections is-
While solving this question, the possible mistake one can make is by always choosing n students for all sections from mn students which is totally wrong because at a time one student can only be in 1 section. So, if n students are selected for 1 section then in the second section, we will choose from (mn – n).
The number of ways in which mn students can be distributed equally among m sections is-
While solving this question, the possible mistake one can make is by always choosing n students for all sections from mn students which is totally wrong because at a time one student can only be in 1 section. So, if n students are selected for 1 section then in the second section, we will choose from (mn – n).
The number of ways in which 20 volunteers can be divided into groups of 4, 7 and 9 persons is-
The number of ways in which 20 volunteers can be divided into groups of 4, 7 and 9 persons is-
The number of ways to make 5 heaps of 3books each from 15 different books is-
In these type of questions, it is to be always remembered that separate approaches need to be adopted for distinct and identical objects. Here, the books were distinct or different.
The number of ways to make 5 heaps of 3books each from 15 different books is-
In these type of questions, it is to be always remembered that separate approaches need to be adopted for distinct and identical objects. Here, the books were distinct or different.