karishma.bhargava Wrote:Specifically I don't understand why you have to divide by 4! and 3!.
Thanks for your help in advance!
have you read the word translations strategy guide, and/or studied some sort of reference material on combinations?
this is the standard form of the formula for combinations. if you need to select
r items from a total pool of
n items, then the total number of ways in which you can make that selection is
n! / (r! (n - r)!)
in our strategy guide, this formula is also the general result of our ANAGRAM GRID method. if you don't feel like memorizing the formula itself, or you have difficulty doing so, then you can apply the "anagram grid" to each of the 2 problems.
note that the two numbers whose factorials appear in the denominator will add up to the number
n. this happens above: 3 + 5 is indeed 8, and 4 + 5 is indeed 9.
--
in any case, you don't have to do any actual math to solve this problem.
it should be clear that
the larger the pool, the more combinations that can be chosen.
the consequence is that if i tell you that there are a
specific number of ways of choosing a group of some
specific size, then you MUST know the size of the overall pool. for instance, if there are 126 ways of choosing 5 things out of a pool of
n, then there can only be ONE value of
n satisfying this criterion. we know this is the case, because any larger pool would give more than 126 such combinations, and any smaller pool would give fewer.
remember that, since this is data sufficiency, you don't care what the actual numbers are! just being able to find them, or just
knowing that you can find them, is plenty good.
so, here's the minimal thought process required to solve this problem:
(1)
oh hey, this means i have a unique value for x + 2.
therefore, i have a unique value for x.
therefore, i can find how many combinations of 5 items i'd have.
(2)
oh hey, this means i have a unique value for x + 1.
therefore, i have a unique value for x.
therefore, i can find how many combinations of 5 items i'd have.
so, ans = (d)