-
Target Test Prep 20% Off Flash Sale is on! Code: FLASH20
Redeem
Breaking Down a GMATPrep Divisibility Problem
This week, were going to tackle a challenging GMATPrep problem solving question from the topic of Divisibility (a subset of Number Properties).
Lets start with the problem. Set your timer for 2 minutes. and GO!
*If x and y are positive integers such that x = 8y + 12, what is the greatest common divisor of x and y?(1) x = 12u, where u is an integer
(2) y = 12z, where z is an integer
The first thing youll probably notice: I didnt include the answer choices. The five Data Sufficiency answer choices are always the same, so we should have those memorized. If you dont have them memorized yet, add this to your to do list.
Just in case, here are the five choices (in casual language, not official language):
(A) statement 1 works but statement 2 does not work
(B) statement 2 works but statement 1 does not work
(C) the statements do NOT work alone, but they DO work together
(D) each statement works by itself
(E) nothing works, not even using them together
Okay, now that weve got that out of the way, lets tackle this problem! What is a greatest common divisor?
A plain divisor is a number that divides evenly into another number (divides evenly = returns an integer answer). This kind of number is also called a factor; divisor is just a synonym for factor. For example, 3 is a divisor of 12, because 12 divided by 3 equals an integer (4). Whats another divisor of 12? What is 12 a divisor of? (1, 2, 3, 4, 6, and 12 are all divisors of 12. 12 is a divisor of 24, 36, 48, and so on.)
A common divisor can be calculated for two or more numbers. For example, 3 is a divisor of 12 and its also a divisor of 15. 3, then, is a common divisor of 12 and 15.
The greatest common divisor is the largest number in the set of common divisors between two (or more) numbers. 3 is a common divisor of 12 and 15. Is it the greatest common divisor?
You could test that by writing down all of the divisors for 12 and 15 and then comparing. 12s divisors are 1, 2, 3, 4, 6, and 12. 15s divisors are 1, 3, 5, and 15. 3 is the largest number in common, so yes, 3 is the greatest common divisor of 12 and 15.
Theres one more important thing to discuss here before we dive into the problem important but complex. Ill illustrate with numbers first and then well derive a general principle. 12 and 15 are three digits apart. 3 is also a common divisor of 12 and 15. Three digits apart and 3 is the common divisor by definition, then, 3 must be the greatest common divisor of the two! Consider the numbers 15 and 20. These two are five digits apart and 5 is a common divisor of the two. 5, then, is the greatest common divisor. Think about why before you keep reading.
So, weve said that if the two numbers are a certain number of digits apart, and those two numbers are also divisible by that number of digits, then that number of digits equals the greatest common divisor. In order to prove this to yourself, think about what would be necessary in order for this NOT to be true. Weve got 12 and 15, which are separated by 3 digits and which share 3 as a common divisor, but we want to argue that 3 is not the greatest common divisor (GCD). Whats to stop 5 (a divisor of 15) or 6 (a divisor of 12) from being the GCD? (Besides the fact that 12 isnt divisible by 5 and 15 isnt divisible by 6!)
Well, if 5 is a divisor of two numbers, then those two numbers are both multiples of 5. Given that the two numbers are not the same number, what is the minimum distance you can have between the two? Ah, right. They have to be at least 5 digits apart. What about 6? Same thing. The two different multiples of 6 have to be at least 6 units apart. 12 and 15 are only three units apart so they cant have a common divisor larger than three.
Okay, now that you know that, go back and examine this problem again. Do you want to keep your initial answer or change it?
Were given that x and y are positive integers, and were asked to find the greatest common divisor of these two. Also, were told that x = 8y + 12.
Thats interesting. 8y has to have 2 as a factor (because of the 8), and 12 also has 2 as a factor, so the sum of those two numbers, x, must have 2 as a factor. In fact, 8 and 12 also share 4 as a factor, so x must also have 4 as a factor. The general rule is:
multiple of 2 + multiple of 2 multiple of 2, or adding multiples of 2 will produce another multiple of 2
Note that I didn't use an equals sign there, but an arrow; it only works in that direction. Any other number can be inserted into the above; it will still hold true. Also, that addition sign can be changed to a subtraction sign. In short, if we add or subtract two numbers with a common factor, the sum or difference will also share that common factor.
I dont know anything else about x and y, though, so I dont know what the greatest common factor is. Lets look at the statements. First, were told that x = 12u, where u is an integer. That must be useless, because it doesnt say anything about y. Right?
Not so fast. Weve got more work to do before we can tell! From this statement, we know that 12 must be a factor of x (both 12 and u are factors of x, because they multiply to produce x). Combine this with the equation given in our question stem:
x = 8y + 12
[multiple of 12] = 8y + [multiple of 12]
Hmm. I could rearrange to this:
[multiple of 12] - [multiple of 12]= 8y
So that tells me that 8y is a multiple of 12. What does that tell me about y? Not enough, unfortunately. The full term 8y is divisible by the prime factors of 12 (2, 2, and 3). Is y by itself also divisible by all three of those factors? We dont know for sure. The two 2 factors could come from the constant 8, leaving only the 3 factor definitely coming from the y variable. We know y is divisible by 3, but thats all we know for sure. Statement 1 is not sufficient.
Statement 2 says that y = 12z, where z is an integer. This tells me y is a multiple of 12. Plug that one back into the equation given in the question stem:
x = 8[multiple of 12] + [multiple of 12]
Great! So x is also a multiple of 12, according to that rule we discussed earlier (add two multiples of 12 and the sum will also be a multiple of 12)! So 12 is a common divisor of x and y, but is it the greatest common divisor?
Yes, it is. The equation is really this:
x = [multiple of 12] + 12
That means that, whatever that first multiple of 12 is, were adding only 12 more to it. The two numbers x and 8y, then, are exactly 12 digits apart. Remember our other rule from above: if the two numbers are a certain number of digits apart, and theyre both divisible by that number, then that number is the greatest common divisor. In this case, x and 8y are both divisible by 12, and the two numbers are also 12 digits apart, so 12 is the greatest common divisor.
But we were asked about x and y, not 8y! Hmm. 8y is a multiple of y, so any factors of y are also factors of 8y (plus 8y has an additional three 2s). This means that the GCD of x and y has to be equal to or smaller than the GCD of x and 8y. (If youre not sure why, test some small numbers to see how it works.) We know that 12 is a factor of y, and 12 is also the GCD of x and 8y, so 12 must also be the GCD of x and y.
Statement 2 is sufficient; the correct answer is B.
Key Takeaways for Solving Hard Divisibility Problems:
- Determine that you have a divisibility problem. The problem might mention words such as divisible, divisor, factor, multiple, prime factor, greatest common factor (or divisor), or least common multiple.
- For harder problems, know the more obscure rules. When you add or subtract two numbers that share a common factor, the sum or difference also shares that factor. When you have two numbers that are n digits apart, and both numbers are also divisible by n, then n is the greatest common divisor, or greatest common factor, of the two numbers.
- Know how to use the above obscure rules in an abstract or theoretical way; you may not be given real numbers (as in the above problem).
* GMATPrep questions courtesy of the Graduate Management Admissions Council. Usage of this question does not imply endorsement by GMAC.
Recent Articles
Archive
- May 2024
- April 2024
- March 2024
- February 2024
- January 2024
- December 2023
- November 2023
- October 2023
- September 2023
- July 2023
- June 2023
- May 2023
- April 2023
- March 2023
- February 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- July 2022
- June 2022
- May 2022
- April 2022
- March 2022
- February 2022
- January 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009