Let S={1,2,3ddot,9}dotFork=1,2, 5,l e t...

Let `S={1,2,3ddot,9}dotFork=1,2, 5,l e tN_k` be the number of subsets of S, each containing five elements out of which exactly `k` are odd. Then `N_1+N_2+N_3+N_4+N_5=?` 210 (b) 252 (c) 125 (d) 126

AI Generated Solution

Similar Questions

Explore conceptually related problems

The number of all subsets of a set containing 2n+1 elements which contains more than n elements is

Let S={(1,2,3,......,n) and f_(n) be the number of those subsets of Swhich do not contain consecutive elementsof S, then

A set contains (2n+1) elements.If the number of subsets of this set which contain atmost n elements is 4096, then n is

Let A={1,2,3,4,...,n} be a set containing n elements,then for any given k<=n, the number of subsets of A having k as largest element must be

If A={x:x in N and xlt6(1)/(4)} and B={x: x in N and x^(2)le5) the number of subsets of set Axx(AcapB) which contains exactly 3 elements is

The largest number that exactly divides each number of the sequence 1^5-1, 2^5-2, 3^5-3, doth^5-n , ddot is 1 (b) 15 (c) 30 (d) 120

If n(A)=4, n(B)=5 and number of functions from A to B such that range contains exactly 3 elements is k, k/(60) is ………. .