In how many ways can a committee be chosen from among 15 people if you must have at least 3 people on the committee?
This is 15 choose 3, since the committee positions are indistinguishable.
Wait, you also want to add up 15 choose 4 as well...
So you want to sum over 15 choose n where n = 3 to 15
@M0j0jojo Does this make sense to you?
Please say something.
the answer is 32887
but like i dont know how to get it
I think what you have to do is 15C3 + 15C4 +15C5...up to 15C15. but i still dont get the right answer
wio your answer is right but i dont get it
The answer should be 32887
lol is this question really that hard that moderators are leaving too
Sorry, I had to do something.
There are two ways to approach this problem. You can sum up 15C3 + 15C4 + ... + 15C15 Or you can sum up 15C0 + 15C1 + 15C2 and subtract if from 15C0 + 15C1 + ... + 15C15
subtract if from
Essentially, this is the method of counting the opposite event and then subtracting it from the entire number events.
okay thanks
I used a short cut to do 15C0 + ... + 15C15. This is basically asking how many ways are there to form a committee period. We know that every person is either in the committee or not in the committee, so we have 2^15. Another way to do this, which is more mathematical, is to use the binomial theorem. I'll attack below what I mean.
Sorry if it looked like I was stuck, I just wasn't actually around to answer your question.
Doesn't look like 32887 http://www.wolframalpha.com/input/?i=Sum+from+n%3D3+to+n%3D15+of+15+choose+n
Join our real-time social learning platform and learn together with your friends!