In an earlier post , I wrote about the GMAT’s tendency to ask questions regarding the number properties of two two-digit numbers whose tens and units digits have been reversed.
The biggest takeaways from that post were:
For the hardest GMAT questions, we’re typically mixing and matching different types of number properties and strategies, so it can be instructive to see how the above axioms might be incorporated into such problems.
Take this challenging Data Sufficiency question, for instance:
When the digits of two-digit, positive integer M are reversed, the result is the two-digit, positive integer N. If M > N, what is the value of M?
(1) The integer (M –N) has 12 unique factors.
(2) The integer (M –N) is a multiple of 9.
The average test-taker looks at Statement 1, sees that it will be very difficult to simply pick numbers that satisfy this condition, and concludes that this can’t possibly be enough information. Well, the average test-taker also scores in the mid-500’s, so that’s not how we want to think.
First, let’s concede that Statement 1 is a challenging one to evaluate and look at Statement 2 first. Notice that Statement 2 tells us something we already know – as we saw above, anytime you have two two-digit numbers whose tens and units digits are reversed, the difference will be a multiple of 9. If Statement 2 is useless, we can immediately prune our decision tree of possible correct answers. Either Statement 1 alone is sufficient, or the statements together are not sufficient, as Statement 2 will contribute nothing. So right off the bat, the only possible correct answers are A and E.
If we had to guess, and we recognize that the average test-taker would likely conclude that Statement 1 couldn’t be sufficient, we’d want to go in the opposite direction – this question is significantly more difficult (and interesting) if it turns out that Statement 1 gives us considerably more information than it initially seems.
In order to evaluate Statement 1, it’s helpful to understand the following shortcut for how to determine the total number of factors for a given number. Say, for example, that we wished to determine how many factors 1000 has. We could, if we were sufficiently masochistic, simply list them out (1 and 1000, 2 and 500, etc.). But you can see that this process would be very difficult and time-consuming.
Alternatively, we could do the following. First, take the prime factorization of 1000. 1000 = 10^3, so the prime factorization is 2^3 * 5^3. Next, we take the exponent of each prime base and add one to it. Last, we multiply the results. (3+1)*(3+1) = 16, so 1000 has 16 total factors. More abstractly, if your number is x^a * y^b, where x and y are prime numbers, you can find the total number of factors by multiplying (a+1)(b+1).
Now let’s apply this process to Statement 1. Imagine that the difference of M and N comes out to some two-digit number that can be expressed as x^a * y^b. If we have a total of 12 factors, then we know that (a+1)(b+1) = 12. So, for example, it would work if a = 3 and b = 2, as a + 1 = 4 and b + 1 = 3, and 4*3 =12. But it would also work if, say, a = 5 and b = 1, as a + 1 = 6 and b + 1 = 2, and 6*2 = 12. So, let’s list out some numbers that have 12 factors:
Now remember that M – N, by definition, is a multiple of 9, which will have at least 3^2 in its prime factorization. So the second option is no longer a candidate, as its prime factorization contains only one 3. Also recall that we’re talking about the difference of two two-digit numbers. 2^2 * 3^3 is 4*27 or 108. But the difference between two positive two-digit numbers can’t possibly be a three-digit number! So the third option is also out.
The only possibility is the first option. If we know that the difference of the two numbers is 2^3 * 3^2, or 8*9 = 72, then only 91 and 19 will work. So Statement 1 alone is sufficient to answer this question, and the answer is A.
Algebraically, if M = 10x + y, then N = 10y + x.
M – N = (10x + y) – (10y + x) = 9x – 9y = 9(x – y).
If 9(x – y) = 72, then x – y = 8. If the difference between the tens and units digits is 8, the numbers must be 91 and 19.
Takeaway: the hardest GMAT questions will require a balance of strategy and knowledge. In this case, we want to remember the following:
By David Goldstein , a Veritas Prep GMAT instructor based in Boston . You can find more articles written by him here .
This article first appeared here The Patterns to Solve GMAT Questions with Reversed-Digit Numbers – Part II