Home
Class 12
MATHS
Let N = the number of ways of choosing 1...

Let N = the number of ways of choosing 10 objects out of 31 objects of which 10 are identtical and the remaining are distinct, then `2^(-22)` N = ________

Text Solution

Verified by Experts

The correct Answer is:
0.25
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise EXERCISE (Concept-based) Single Correct Answer Type Questions |10 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise EXERCISE (LEVEL 1) Single Correct Answer Type Questions |62 Videos

  • PERMUTATIONS AND COMBINATIONS

    MCGROW HILL PUBLICATION|Exercise SOLVED EXAMPLES (LEVEL 2) Single Correct Answer Type Questions |14 Videos

  • PARABOLA

    MCGROW HILL PUBLICATION|Exercise QUESTIONS FROM PREVIOUS YEARS. B-ARCHITECTRE ENTRANCE EXAMINATION PAPERS|9 Videos

  • PROBABILITY

    MCGROW HILL PUBLICATION|Exercise Previous Years B-Architecture Entrance Examination Papers|21 Videos

Similar Questions

Explore conceptually related problems

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

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). Statement 2: 42.Statement 2: 42C_(0)+^(42)C_(1)+^(42)C_(2)+...+^(42)C_(21)=2^(41)

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

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

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

MCGROW HILL PUBLICATION-PERMUTATIONS AND COMBINATIONS -SOLVED EXAMPLES (LEVEL 2) Numerical Answer Type Questions
  1. All possible numbers are formed using the digits 1, 1, 2, 2, 2, 2, 3, ...

    Text Solution

    |

  2. The number of numbers divisible by 3 that can be formed by four non-ze...

    Text Solution

    |

  3. Let N be the number of four digit numbers that can be with the digits ...

    Text Solution

    |

  4. If ""^(52)C(4)+sum(j-1)^(5)(""^(51+j)C(3))=""^(n)C(53), then n = .

    Text Solution

    |

  5. The number of values of n in N for which ""^(10)C(n-1)gt 2(""^(10)C(n)...

    Text Solution

    |

  6. The number of ways in which four A's and five B's can be arranged alon...

    Text Solution

    |

  7. Let N = the number of four letter words that can be formed from the En...

    Text Solution

    |

  8. Let N = The number of four-digit numbers strictly greater than 4321 th...

    Text Solution

    |

  9. A committee of 11 members is to be formed from 8 men and 5 women. If ...

    Text Solution

    |

  10. Let N = the number of 6 digit numbers that can be formed from the digi...

    Text Solution

    |

  11. Let N = the number of four digit numbers of the form a(1)a(2)a(3)a(4) ...

    Text Solution

    |

  12. Let N = the number of ways to fill each of the four cells of the table...

    Text Solution

    |

  13. If letters of the word NIGHT are arranged in all possible manner and w...

    Text Solution

    |

  14. Let N = the number of ways of choosing 10 objects out of 31 objects of...

    Text Solution

    |

  15. A group of students consists of 5 boys and n girls. If the number of w...

    Text Solution

    |

  16. Let N = the number of ways of forming a committee of 6 members out of ...

    Text Solution

    |

  17. Let N = the number of 10 digit numbers that can be formed with all the...

    Text Solution

    |

  18. There are 20 straight lines in a plane such that no two of them are pa...

    Text Solution

    |

  19. If 15^(k) divides 50! but 15^(k+1) doesn’t divide 50!, then k = .

    Text Solution

    |