Correctly Solve Vague GMAT Questions:
Questions on the GMAT can be described in many different ways. I’ve heard them described as everything from juvenile to vexing, simple to impossible. One term that appears very infrequently as a characteristic of the questions on the GMAT is the word “clear.” Indeed, some questions are so convoluted that they appear to be written in Latin. This is not a coincidence or an accident; many GMAT questions are specifically designed to be vague.
What do I mean by vague? I do not mean that two possible answers could both be the correct answer to the query. What happens on the exam is that a question is asked, but deciphering what that actually means is a task unto itself.
Let’s look at a simple example. If a question asks: “X is twice as big as Y. Y is 5. What is X?”, then it would be considered painfully simple. Y is known to be 5, X is double that, so the answer is 10 (don’t forget to carry the 1). If the exact same question were phrased as “John has two pineapples for every pineapple that Mary has. Mary counted the number of pineapples she had, and the number was the smallest prime factor of 35. How many pineapples does John have?” This question essentially asks for the same result, but the wording is so convoluted that many people get lost in it and do not reach the correct answer.
While you likely won’t get a question like the above example, every convoluted question can be broken down to a similar simple problem. The simplification won’t always be easy, but the tricks utilized on the GMAT to make questions long-winded repeat over and over again. Hopefully, if you have seen a few of them during your preparation, you’re more likely to know how to translate the GMATese (Patent Pending) and get the right answer on test day.
Let’s look at a typical vague question on the GMAT:
A group of candidates for two analyst positions consists of six people. If one-third of the candidates are disqualified and three new candidates are recruited to replace them, the number of ways in which the two job offers can be allocated will:
(A) Drop by 40%
(B) Remain unchanged
(C) Increase by 20%
(D) Increase by 40%
(E) Increase by 60%
After reading such a question, you may still not be sure what to do, but you can start piecing together the issue at hand. There are six people interviewing for two jobs, but then some will drop out and others will join, and the overall impact must be gauged. The answer choices seem to offer various increases and decreases, so the answer must be in terms of the adjustment of job offer possibilities. This makes the question seem like a combinatorics or probability question.
Looking at the information provided, we have six applicants for two positions, and then one-third of them are disqualified. This leaves us with four finalists for the two jobs (like musical chairs), but before a decision is rendered, three more applicants join. There are now seven candidates for the two jobs, yielding a net change of one new contender. From 6 to 7 people, the change would be 1/6 of the old total, or 16.7%. This is closest to answer choice C, but there is no direct match among the answer choices. Since the GMAT doesn’t provide horseshoe answer choices (unless approximation is specified), this is our first hint that we may need to dig deeper in our approach.
The questions specifically asks about “the number of ways in which the two job offers can be allocated,” which should hopefully make you realize that the question is ultimately about permutations. In the initial setup, two positions are available for six candidates, meaning we can calculate the number of possible outcomes.
The only decision we have to make is about the order mattering, and since it’s not indicated anywhere that the jobs are identical, it’s reasonable to assume we can differentiate between job 1 and job 2. Let’s say that the first job is a senior position and the second is a junior position, how many ways can we fill these openings? Anyone can take the first position, so that gives us 6 possibilities, and then anyone of the remaining choices can fill the second position, yielding another 5 possibilities. Since any of these can be combined, we get or 30 choices. Using the permutation formula of yields which is still or 30, confirming our answer.
If there were 30 possibilities at first, the addition of a new candidate will undoubtedly increase the number of possibilities, so we can consider answer choices A and B eliminated. After the increase, we can essentially make the same calculations for 7 candidates and 2 jobs, giving us or 42 choices. We used to have 30 choices and now we have 42, so that works out to 12 new choices out of the original 30, equivalent to a 40% increase. Answer choice D is a 40% increase, and thus exactly the correct answer.
Some of you may be asking about the assumption I made about order mattering a few paragraphs back. “What happens if we assume that the order doesn’t matter?”Let’s run the calculations to see. If the order doesn’t matter and we’re dealing with a combination, then we have 6 candidates for 2 positions, we will get which is . Simplifying to gives us 15 options instead of the previous 30. Really, these are the same options but now we divide by two because the order no longer matters (i.e. AB and BA are equivalent). The updated scenario will have , which becomes or 21. This is exactly half the previous number again. The delta from 15 to 21 is 6, again 40% of the initial sum of 15. Since we’re dealing with percentages, both combinations and permutations will be completely equivalent. (Ain’t math grand?)
Regardless of minor assumptions made while solving this problem, the solution will always be the same. Indeed, the hardest part of solving the problem is often determining what is being asked. Remember that there can only be one answer to the problem, and that the answer choices can help steer you in the right direction. If you know what you’re looking for, the questions on the GMAT may be somewhat vague, but your goal will be crystal clear.
Plan on taking the GMAT soon? We have GMAT prep courses starting all the time.