Bunuel wrote:
What is the largest integer that divides evenly into positive integers m and n?
(1) m – n = 1
(2) m does not divide evenly into n.
Forget conventional ways of solving math questions. For DS problems, the VA (Variable Approach) method is the quickest and easiest way to find the answer without actually solving the problem. Remember that equal numbers of variables and independent equations ensure a solution.
Visit
https://www.mathrevolution.com/gmat/lesson for details.
The first step of the VA (Variable Approach) method is to modify the original condition and the question. We then recheck the question. We should simplify conditions if necessary.
The question asks the value of gcd(m,n).
Condition 1) tells n and m = n + 1 are two consecutive integers.
We have gcd(m,n)=1 since m and n are two consecutive integers.
Thus condition 1) is sufficient.
Condition 2)
If m=6, n=10, then gcd(m,n) = 2.
If m=6, n=15, then gcd(m,n) = 3.
Since condition 2) does not yield a unique solution, it is not sufficient.
Therefore, A is the answer.
If the original condition includes “1 variable”, or “2 variables and 1 equation”, or “3 variables and 2 equations” etc., one more equation is required to answer the question. If each of conditions 1) and 2) provide an additional equation, there is a 59% chance that D is the answer, a 38% chance that A or B is the answer, and a 3% chance that the answer is C or E. Thus, answer D (conditions 1) and 2), when applied separately, are sufficient to answer the question) is most likely, but there may be cases where the answer is A,B,C or E.