by RonPurewal Sun Jun 10, 2012 4:26 am
here are a couple of ways that you can solve this one.
1/
MAKE LISTS
just make lists of possibilities that satisfy the statements. (obviously, you should use some table or chart when you do this on your own paper, but i just wrote out lists because it's rather difficult to format tables or charts on the forum.)
STATEMENT (1)
here's a systematic list of possibilities:
* 5 candies after removal, with 1 peppermint --> 6 and 2 respectively, before removal
* 10 candies after removal, with 2 peppermint --> 11 and 3 respectively, before removal
* 15 candies after removal, with 3 peppermint --> 16 and 4 respectively, before removal
* 20 candies after removal, with 1 peppermint --> 21 and 5 respectively, before removal
* 25 candies after removal, with 1 peppermint --> 26 and 6 respectively, before removal
etc.
tons of possibilities, so, insufficient.
note that you should stop after you find the first two cases. i've just listed more cases here so that the whole post is easier to follow (i.e., so that i don't have to list the rest of the possibilities later, creating a fragmented post).
STATEMENT (2)
here's a systematic list of possibilities:
* 4 candies after removal, with 1 peppermint --> 6 and 1 respectively, before removal
* 8 candies after removal, with 2 peppermint --> 10 and 2 respectively, before removal
* 12 candies after removal, with 3 peppermint --> 14 and 3 respectively, before removal
* 16 candies after removal, with 1 peppermint --> 18 and 4 respectively, before removal
* 20 candies after removal, with 1 peppermint --> 22 and 5 respectively, before removal
* 24 candies after removal, with 6 peppermint --> 26 and 6 respectively, before removal
etc.
tons of possibilities, so, insufficient.
again, you should stop after you find the first two cases, but i'm just putting the whole list in one place so the post is easier to follow.
TOGETHER:
there's only one case that appears in both lists:
* 24 candies after removal, with 6 peppermint --> 26 and 6 respectively, before removal
if you continue the lists far enough, you'll see that there aren't going to be any other common elements. so, this is the only one.
sufficient.
answer (c)
---------------------------------------------------
---------------------------------------------------
2/
ALGEBRA
first -- as should be customary for all word problems -- temporarily ignore the actual math, and just take an inventory of what's happening in the problem.
in the problem, we have two unknowns -- the total number of candies and the number of peppermint candies -- that are at first independent of each other. (you don't need another unknown for the number of spearmint candies, because that's just the difference between the aforementioned two quantities.)
because there is no necessary relationship between these quantities at the beginning of the problem, go ahead and designate two variables, say "t" for the total number of candies, and "p" for the number of peppermint candies.
STATEMENT (1)
if one peppermint candy is removed, there are now a total of (t - 1) candies, of which (p - 1) are peppermint.
thus
(1/5)(t - 1) = p - 1
or
(p - 1)/(t - 1) = 1/5
either of which can be rearranged to
t - 1 = 5p - 1
there are infinitely many values of p and t that satisfy this equation, so this statement is not sufficient.
STATEMENT (2)
if 2 spearmint candies are removed, there are now a total of (t - 2) candies, of which p are peppermint.
thus
(1/4)(t - 2) = p
or
(p)/(t - 2) = 1/4
which can be rearranged to
t - 2 = 4p
there are infinitely many values of p and t that satisfy this equation, so this statement is not sufficient.
TOGETHER
from the individual statements, we have both of the following:
t - 1 = 5p - 1
t - 2 = 4p
this is a system that can be solved for unique values of t and p, so, sufficient.
answer (c)