Quote:
Originally Posted by aimgre08
yes that is correct for that combination problem and
for the other combination problem on dollars,(am not sure if i am correct!!)
Total no of ways of giving 7 dollars to 3 people and each should have min.1 dollar is similar to no. of ways of giving 4 dollars to 3 people = 3^4
Total no. of ways of giving 7 dollsrs to 3 people and 1 getting min 3dollars, other two a minimum of 1 dollar is similar to no of ways of giving 2 dollars to 3 people = 3^2
so the value in Column B is greater.
|
I think you are right in the first part. No.of ways with everyone having atleast 1 dolloar = (3C1)^4 But, total no of ways with atleast one person having 3 dollars should be as follows: No of ways 3 dollars can be given to a any of the 3 people = 3 ways. Then, no of way remaining 4 dollars can be given to 3 people is (3C1)^4 . Since, since, for every dollar you can choose among one of the 3. Therefore, total would be 3*(3C1)^4. Therefore, A is greater. ( I am wondering why my paragraphs are getting reformatted, and getting squished into one big blob of text. Anyone having similar problems )