Home
Class 12
MATHS
If n denotes the number of ways of se...

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

A

`.^(r-1)C_(r-n)`

B

`.^(r-1)C_(n)`

C

`.^(r-1)C_(n-1)`

D

`.^(r-1)C_(r-n-1)`

Text Solution

Verified by Experts

The correct Answer is:
A, C
`becausex_(1)+x_(2)+x_(3)+ . . .+x_(n)=r, Aa x_(i)ge1,(1 le I le )`
Total number of such solutions `=.^(r-1)C_(n-1)=.^(r-1)C_(r-n)`
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS ENGLISH|Exercise Exercise (Passage Based Questions)|15 Videos

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS ENGLISH|Exercise Exercise (Single Integer Answer Type Questions)|10 Videos

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS ENGLISH|Exercise Exercise (Single Option Correct Type Questions)|30 Videos

  • PARABOLA

    ARIHANT MATHS ENGLISH|Exercise Exercise (Questions Asked In Previous 13 Years Exam)|36 Videos

  • PROBABILITY

    ARIHANT MATHS ENGLISH|Exercise Exercise (Questions Asked In Previous 13 Years Exam)|54 Videos

Similar Questions

Explore conceptually related problems

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

The value of sum_(r=1)^(n+1)(sum_(k=1)^n "^k C_(r-1)) ( where r ,k ,n in N) is equal to a. 2^(n+1)-2 b. 2^(n+1)-1 c. 2^(n+1) d. none of these

Find sum of sum_(r=1)^n r . C (2n,r) (a) n*2^(2n-1) (b) 2^(2n-1) (c) 2^(n-1)+1 (d) None of these

The value of sum_(r=0)^(n-1)^n C_r//(^n C_r+^n C_(r+1)) equals a. n+1 b. n//2 c. n+2 d. none of these

If ""^(n)C _r denotes the numbers of combinations of n things taken r at a time, then the expression ""^(n) C_(r+1) +""^(n)C_(r-1) +2 xx ""^(n)C_r equals

n points are given of which r points are collinear, then the number of straight lines that can be found = (a) ""^(n)C_(2)-""^(r)C_(2) (b) ""^(n)C_(2)-""^(r)C_(2)+1 (c) ""^(n)C_(2)-""^(r)C_(2)-1 (d) None of these

If .^(n)C_(r-1)=36, .^(n)C_(r)=84 and .^(n)C_(r+1)=126 , find n and r.

For ""^(n) C_(r) + 2 ""^(n) C_(r-1) + ""^(n) C_(r-2) =

Prove that .^(n)C_(r )+.^(n-1)C_(r )+..+.^(r )C_(r )=.^(n+1)C_(r+1)

If C_r stands for .^nC_r and sum_(r=1)^n (r.C_r)/(C_(r-1)) =210 then n= (A) 19 (B) 20 (C) 21 (D) none of these