prude_sb Wrote:one way of looking at that rule is
let x-y = k an integer
if x and y are both divisible by (x-y) ... is x-y the gcf ...
then x/(x-y) = k where k is an integer. Now the question is can there be any additional divisor for k that will be common between x and y
x = xk -yk
y * k = x * (k-1)
there will be no common divisors between k and k-1 ... consecutive numbers ...
so k is indeed the largest number that can divide both x and y
this sort of approach works, yes.
for my readers, though, let me tell you that there is NO WAY the current incarnation of the gmat is going to require this sort of arithmetical gymnastics. it's no coincidence that the above question was purged after the 10th edition of the OG.
recent gmat problems are pretty much ALL focused on manipulating
elementary algebra, arithmetic, etc. in unconventional and extremely clever ways.
if you have this sort of advanced background, where you can turn out number-theory approaches such as the one above, then go for it.
if not, don't worry about it.