Home
Class 12
MATHS
The number of ways of choosing 10 object...

The number of ways of choosing 10 objects out of 31 objects of which 10 are identical and the remaining 21 are distinct, is

A

`2^(20)-1`

B

`2^(21)`

C

`2^(20)`

D

`2^(20)+1`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of choosing 10 objects from a total of 31 objects, where 10 are identical and 21 are distinct, we can break down the solution step by step. ### Step 1: Understand the Composition of Objects We have: - 10 identical objects (let's call them A) - 21 distinct objects (let's call them B1, B2, ..., B21) ### Step 2: Define the Selection Scenarios When choosing 10 objects, we can choose a certain number of identical objects (A) and the rest from the distinct objects (B). Let \( x \) be the number of identical objects chosen. Therefore, \( x \) can take values from 0 to 10 (i.e., \( x = 0, 1, 2, ..., 10 \)). The remaining objects will then be selected from the distinct objects. ### Step 3: Calculate the Number of Distinct Objects Chosen If we choose \( x \) identical objects, we need to choose \( 10 - x \) distinct objects from the 21 available distinct objects. The number of ways to choose \( 10 - x \) distinct objects from 21 is given by the binomial coefficient \( \binom{21}{10 - x} \). ### Step 4: Sum Over All Possible Values of \( x \) We need to sum the number of ways for all possible values of \( x \): \[ S = \sum_{x=0}^{10} \binom{21}{10 - x} \] This can be rewritten as: \[ S = \binom{21}{10} + \binom{21}{9} + \binom{21}{8} + \ldots + \binom{21}{0} \] ### Step 5: Use the Identity for Binomial Coefficients Using the identity for binomial coefficients, we know that: \[ \sum_{k=0}^{n} \binom{n}{k} = 2^n \] In our case, we can use this identity to find: \[ \sum_{k=0}^{21} \binom{21}{k} = 2^{21} \] However, since we are only summing from \( k = 0 \) to \( k = 10 \), we can use the symmetry of binomial coefficients: \[ \sum_{k=0}^{10} \binom{21}{k} = \sum_{k=11}^{21} \binom{21}{k} \] Thus, we have: \[ \sum_{k=0}^{10} \binom{21}{k} = \frac{1}{2} \cdot 2^{21} = 2^{20} \] ### Final Result Therefore, the total number of ways to choose 10 objects from the given set is: \[ S = 2^{20} \] ### Conclusion The answer is \( 2^{20} \). ---
Promotional Banner

Topper's Solved these Questions

  • PERMUTATION & COMBINATION

    VMC MODULES ENGLISH|Exercise LEVEL-2|88 Videos
  • MOCK TEST 9

    VMC MODULES ENGLISH|Exercise MATHEMATICS (SECTION 2)|5 Videos
  • PROBABILITY

    VMC MODULES ENGLISH|Exercise JEE ADVANCED (ARCHIVE)|102 Videos

Similar Questions

Explore conceptually related problems

Statement 1: Number of ways of selecting 10 objects from 42 objects of which 21 objects are identical and remaining objects are distinct is 2^(20)dot Statement 2: ^42 C_0+^(42)C_1+^(42)C_2++^(42)C_(21)=2^(41)dot

Statement 1: Number of ways of selecting 10 objects from 42 objects of which 21 objects are identical and remaining objects are distinct is 2^(20)dot Statement 2: ^42 C_0+^(42)C_1+^(42)C_2++^(42)C_(21)=2^(41)dot

Prove that the number of ways to select n objects from 3n objects of whilch n are identical and the rest are different is 2^(2n-1)+((2n) !)/(2(n !)^2)

Statement 1: When number of ways of arranging 21 objects of which r objects are identical of one type and remaining are identical of second type is maximum, then maximum value of ^13 C_ri s78. Statement 2: ^2n+1C_r is maximum when r=ndot

The number of ways in which five distinct objects can be put into three identical boxes so that no box remains empty is

Find the number of ways of selecting 10 balls out of an unlimited number of identical white, red, and blue balls.

If N denotes the number of ways of selecting r objects of out of n distinct objects (rgeqn) with unlimited repetition but with each object included at least once in selection, then N is equal is a. .^(r-1)C_(r-n) b. .^(r-1)C_n c. .^(r-1)C_(n-1) d. none of these

Find the number of ways of selecting 3 pairs from 8 distinct objects.

Find the number of ways of selecting 3 pairs from 8 distinct objects.

Number of ways in which 6 distinct objects can be kept into two identical boxes so that no box remains empty is

VMC MODULES ENGLISH-PERMUTATION & COMBINATION-JEE ARCHIVE
  1. Find the number of ways in which six '+' and four '-' signs can be arr...

    Text Solution

    |

  2. There are five balls of different colours and five boxes of colours sa...

    Text Solution

    |

  3. The number of ways of choosing 10 objects out of 31 objects of which 1...

    Text Solution

    |

  4. Suppose that 20 pillars of the same height have been erected along the...

    Text Solution

    |

  5. Some identical balls are arranged in rows to form an equilateral trian...

    Text Solution

    |

  6. There are m men and two women participating in a chess tournament. Eac...

    Text Solution

    |

  7. A group of students comprises of 5 boys and n girls. If the number of ...

    Text Solution

    |

  8. Let S be the set of all triangles in the xy-plane, each having one ver...

    Text Solution

    |

  9. The number of 6 digits numbers that can be formed using the digits 0, ...

    Text Solution

    |

  10. A committee of 11 members is to be formed from 8 males and 5 m=females...

    Text Solution

    |

  11. Consider three boxes, each containing 10 balls labelled 1, 2, …,10. Su...

    Text Solution

    |

  12. The number of natural numbers less than 7,000 which can be formed by u...

    Text Solution

    |

  13. Consider a class of 5 girls and 7 boys. The number of different teams ...

    Text Solution

    |

  14. The number of four-digit numbers strictly greater than 4321 that can b...

    Text Solution

    |

  15. The number of seven digit integers, with sum of the digits equal to 10...

    Text Solution

    |

  16. A five-digit numbers divisible by 3 is to be formed using the numberal...

    Text Solution

    |

  17. A number of 18 guests have to be seated, half on each side of a lon...

    Text Solution

    |

  18. If r,s,t are prime numbers and p,q are the positive integers such that...

    Text Solution

    |

  19. Let ngeq2 be integer. Take n distinct points on a circle and join each...

    Text Solution

    |

  20. Let A be a set of n distinct elements. Then the total number of distin...

    Text Solution

    |