[Math Revolution GMAT math practice question]
If m and n are positive integers, what is the greatest common divisor of m and n?
1) m=n+1
2) m*n is divisible by 2
If m and n are positive integers, what is the greatest commo
This topic has expert replies
- Max@Math Revolution
- Elite Legendary Member
- Posts: 3991
- Joined: Fri Jul 24, 2015 2:28 am
- Location: Las Vegas, USA
- Thanked: 19 times
- Followed by:37 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
Math Revolution
The World's Most "Complete" GMAT Math Course!
Score an excellent Q49-51 just like 70% of our students.
[Free] Full on-demand course (7 days) - 100 hours of video lessons, 490 lesson topics, and 2,000 questions.
[Course] Starting $79 for on-demand and $60 for tutoring per hour and $390 only for Live Online.
Email to : [email protected]
- fskilnik@GMATH
- GMAT Instructor
- Posts: 1449
- Joined: Sat Oct 09, 2010 2:16 pm
- Thanked: 59 times
- Followed by:33 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
$$m,n\,\, \geqslant 1\,\,{\text{ints}}$$Max@Math Revolution wrote:[Math Revolution GMAT math practice question]
If m and n are positive integers, what is the greatest common divisor of m and n?
1) m=n+1
2) m*n is divisible by 2
$${\text{?}}\,\,{\text{ = }}\,\,{\text{GCD}}\left( {m,n} \right)$$
$$\left( 1 \right)\,\,\,m = n + 1\,\,\,\,\, \Rightarrow \,\,\,\,? = 1\,\,\,\,\,\left( {{\rm{consecutive}}\,\,{\rm{positive}}\,\,{\rm{integers}}\,\,{\rm{are}}\,\,{\rm{always}}\,\,{\rm{relatively}}\,\,{\rm{prime}}} \right)$$
$$\left( 2 \right)\,\,\,{{m \cdot n} \over 2} = {\mathop{\rm int}} \,\,\,\,\,\left\{ \matrix{
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {1,2} \right)\,\,\,\,\, \Rightarrow \,\,\,\,\,? = 1\,\, \hfill \cr
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {2,2} \right)\,\,\,\,\, \Rightarrow \,\,\,\,\,? = 2\,\, \hfill \cr} \right.\,\,$$
The correct answer is therefore (A).
This solution follows the notations and rationale taught in the GMATH method.
Regards,
Fabio.
Fabio Skilnik :: GMATH method creator ( Math for the GMAT)
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
- fskilnik@GMATH
- GMAT Instructor
- Posts: 1449
- Joined: Sat Oct 09, 2010 2:16 pm
- Thanked: 59 times
- Followed by:33 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
$$m,n\,\, \geqslant 1\,\,{\text{ints}}$$Max@Math Revolution wrote:[Math Revolution GMAT math practice question]
If m and n are positive integers, what is the greatest common divisor of m and n?
1) m=n+1
2) m*n is divisible by 2
$${\text{?}}\,\,{\text{ = }}\,\,{\text{GCD}}\left( {m,n} \right)$$
$$\left( 1 \right)\,\,\,m = n + 1\,\,\,\,\, \Rightarrow \,\,\,\,? = 1\,\,\,\,\,\left( {{\rm{consecutive}}\,\,{\rm{positive}}\,\,{\rm{integers}}\,\,{\rm{are}}\,\,{\rm{always}}\,\,{\rm{relatively}}\,\,{\rm{prime}}} \right)$$
$$\left( 2 \right)\,\,\,{{m \cdot n} \over 2} = {\mathop{\rm int}} \,\,\,\,\,\left\{ \matrix{
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {1,2} \right)\,\,\,\,\, \Rightarrow \,\,\,\,\,? = 1\,\, \hfill \cr
\,{\rm{Take}}\,\,\left( {m,n} \right) = \left( {2,2} \right)\,\,\,\,\, \Rightarrow \,\,\,\,\,? = 2\,\, \hfill \cr} \right.\,\,$$
The correct answer is therefore (A).
This solution follows the notations and rationale taught in the GMATH method.
Regards,
Fabio.
Fabio Skilnik :: GMATH method creator ( Math for the GMAT)
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
- Max@Math Revolution
- Elite Legendary Member
- Posts: 3991
- Joined: Fri Jul 24, 2015 2:28 am
- Location: Las Vegas, USA
- Thanked: 19 times
- Followed by:37 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
=>
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.
Since two consecutive integers are always relatively prime, the greatest common divisor of m and n is 1. Thus, condition 1) is sufficient.
Condition 2)
If m = 2 and n = 3, then the greatest common divisor of m and n is 1.
If m = 2 and n = 4, then the greatest common divisor of m and n is 2.
Thus, condition 2) is not sufficient since it does not yield a unique solution.
Therefore, the correct answer is A.
Answer: A
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.
Since two consecutive integers are always relatively prime, the greatest common divisor of m and n is 1. Thus, condition 1) is sufficient.
Condition 2)
If m = 2 and n = 3, then the greatest common divisor of m and n is 1.
If m = 2 and n = 4, then the greatest common divisor of m and n is 2.
Thus, condition 2) is not sufficient since it does not yield a unique solution.
Therefore, the correct answer is A.
Answer: A
Math Revolution
The World's Most "Complete" GMAT Math Course!
Score an excellent Q49-51 just like 70% of our students.
[Free] Full on-demand course (7 days) - 100 hours of video lessons, 490 lesson topics, and 2,000 questions.
[Course] Starting $79 for on-demand and $60 for tutoring per hour and $390 only for Live Online.
Email to : [email protected]