'Renee has a bag of 6 candies, 4 of which are sweet and 2 of which are sour. Jack picks 2 candies simultaneously and at random. What is chance exactly 1 of candies he picked is sour."
This came from MGMAT Num Prop Strat guide p.119 and the solution uses probability tree to demonstrate that P(sour first, sweet second) = 8/30 and P(sweet first, sour second) = 8/30, for a total P(1 sour) = 16/30. I'm wondering if there is a way to solve this without probability tree.
GMAT Forum
2 postsPage 1 of 1
- jk21
- Forum Guests
- Posts: 2
- Joined: Wed Jul 31, 2013 5:07 pm
- RonPurewal
- Students
- Posts: 19744
- Joined: Tue Aug 14, 2007 8:23 am
Re: Renee has a bag of 6 candies
hi,
this is the wrong folder for this question; you should be posting these things in the MGMAT Non-CAT folder. please do so in the future. (this thread is now locked; if you have any further questions about this problem, please post a thread in the correct folder.)
you don't have to use a probability tree diagram per se, but, whatever organizational device / thought process you decide to use is basically going to have to be equivalent to the tree.
the bare bones of the process, basically: you have to multiply the consecutive probabilities.
the probability tree is a convenient way of reminding you that you have to do this multiplication -- but, if you don't like it, you can always come up with alternative devices/frameworks.
finally, there's one totally different way to do the problem, which is to simply make a list of all the possibilities and then circle the ones that satisfy the requirement.
this is the wrong folder for this question; you should be posting these things in the MGMAT Non-CAT folder. please do so in the future. (this thread is now locked; if you have any further questions about this problem, please post a thread in the correct folder.)
you don't have to use a probability tree diagram per se, but, whatever organizational device / thought process you decide to use is basically going to have to be equivalent to the tree.
the bare bones of the process, basically: you have to multiply the consecutive probabilities.
the probability tree is a convenient way of reminding you that you have to do this multiplication -- but, if you don't like it, you can always come up with alternative devices/frameworks.
finally, there's one totally different way to do the problem, which is to simply make a list of all the possibilities and then circle the ones that satisfy the requirement.
2 posts Page 1 of 1