Data Sufficiency

The SBC GMAT Files

Factorization/Divisibility/Problem Solving/Data Sufficiency

A solid knowledge of number properties is generally not enough for handling the most advanced factorization problems on the Quant. Although most students can handle the simple task of finding the prime factorization of a number, only rarely will you see a question phrased so bluntly. More likely, the question will only hint at the issue in a roundabout fashion:

If x, y and z are positive integers, is it true that x2 is divisible by 16?

1.    5x = 4y
2.    3×2 = 8z
There’s not a word mentioning prime factorization, yet clearly this is the issue being tested. Two hints clue us to this fact:

1.    The test for divisibility involves variables, but no remainder is mentioned
2.    All (or many) of the variables in the problem are limited to integers

The presence of these two clues together often suggest that you should divide and conquer. Much like the military tactic, mathematical division can help break a complex problem into smaller, bite-sized chunks that are easier to handle.
The difficulty here is that each statement involves two variables that we need to juggle in our heads. Clearly, it would be far simpler if we only had to consider one variable at a time. Let’s divide and conquer so we can do just that, starting with statement 1):

5x = 4y
Divide both sides by 4 to get:
5x/4 = y

The right-side of the equation is an integer since y is an integer. So logically, the left-side of the equation must be an integer, too. If we now focus only on the left-side of the equation, we only need to concern ourselves with a single expression with a single variable: 5x/4.

In order for 5x/4 to be an integer, all of the prime factors in the denominator (two 2’s) must also be present in the numerator (which contains 5 and x). This must be true in order for 5x/4 to be an integer. Because the 5 in the numerator does not contain any factors of 2, x must contain at least two factors of 2.  x2  then, must contain at least four factors of 2. In other words, x2 must also divisible by 16. The answer to the question stem is therefore a definite Yes.
Statement 2) can be conquered using the same tactic:

3×2 = 8z

Divide both sides by 8 to obtain

3×2 /8 = z

Using the same logic, we see that 3×2 must contain at least three factors of 2. Since 3 obviously won’t contain any factors of 2, they must all come from the x2 term.

At first glance, it may seem like we have insufficient data, since we have only been able to prove that x2 has at least three factors of 2 rather than four. Notice, however, that since x itself is an integer, x2 must be a perfect square.

A perfect square must contain an even number of each prime factor. As an example, consider the perfect squares 4 (two factors of 2), 81 (four factors of 3), and 400 (four factors of 2, two factors of 5). If x2 contained only three factors of 2, such as if x2 = 8, it would no longer be a perfect square. If we were to take √x2 , we would end up with x = √8 = 2.82, which is not an integer. As a result, x2 must always contain an even number of factors, or a minimum of at least four factors of 2. Once again, we have a definite Yes answer to the question stem. The answer to this data sufficiency question is therefore D): each statement alone is sufficient.

When dealing with these hidden factorization problems remember the following divide and conquer tactic:
1.    Identify a single variable that must be an integer; isolate that variable on one side of the equation
2.    Focus on the complicated expression on the other side of the equation; it must also be an integer
3.    Figure out what prime factors must be present in the variables; the numerator must contain at least the same number of prime factors as the denominator
4.    If the expression involves a perfect square, go back to revise the number of prime factors so that there are an even number for each factor. Perfect cubes will have factors that come in triplets, and so on.

***

More Testing Advice from our blog

Return to the GMAT Files Main Page