GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 13 Nov 2018, 20:50

Close

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel
Events & Promotions in November
PrevNext
SuMoTuWeThFrSa
28293031123
45678910
11121314151617
18192021222324
2526272829301
Open Detailed Calendar
  • Essential GMAT Time-Management Hacks

     November 14, 2018

     November 14, 2018

     07:00 PM PST

     08:00 PM PST

    Join the webinar and learn time-management tactics that will guarantee you answer all questions, in all sections, on time. Save your spot today! Nov. 14th at 7 PM PST
  • $450 Tuition Credit & Official CAT Packs FREE

     November 15, 2018

     November 15, 2018

     10:00 PM MST

     11:00 PM MST

    EMPOWERgmat is giving away the complete Official GMAT Exam Pack collection worth $100 with the 3 Month Pack ($299)

If gcd(m,n) is the greatest common divisor of m and n, then n=?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 6500
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post 11 Jul 2018, 00:09
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

67% (01:28) correct 33% (01:06) wrong based on 39 sessions

HideShow timer Statistics

[GMAT math practice question]

If \(gcd(m,n)\) is the greatest common divisor of \(m\) and \(n\), then \(n=?\)

1) \(gcd(m,n)=n\)
2) \(gcd(m,gcd(m,n))= 30\)

_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"

MBA Section Director
User avatar
D
Affiliations: GMATClub
Joined: 22 May 2017
Posts: 948
Concentration: Nonprofit
GPA: 4
WE: Engineering (Computer Software)
If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post Updated on: 11 Jul 2018, 03:45
1
To find the value of n

Statement 1

\(gcd(m,n) = n\)

The values of m = 10, n = 2 satisfy the given statement.
The values of m = 10, n = 1 satisfy the given statement.

Hence statement 1 alone is not sufficient to find unique value of n

Statement 2

\(gcd(m,gcd(m,n)) = 30\)

The values of m = 30, n = 60 satisfy the given statement.
The values of m = 30, n =90 satisfy the given statement.

Hence statement 2 alone is not sufficient to find unique value of n

Statements 1 and 2 together

\(gcd(m,n) = n\) and \(gcd(m,gcd(m,n))=30\)

Substituting the value of \(gcd(m,n)=n\) in statement 2

=> \(gcd(m,n) = 30\)
=> \(n = 30\) which gives a unique value for n

Hence option C
_________________

If you like my post press kudos +1

New project wSTAT(which Schools To Apply To?)

New - RC Butler - 2 RC's everyday


Originally posted by workout on 11 Jul 2018, 01:11.
Last edited by workout on 11 Jul 2018, 03:45, edited 2 times in total.
Senior Manager
Senior Manager
avatar
S
Joined: 04 Aug 2010
Posts: 305
Schools: Dartmouth College
If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post Updated on: 11 Jul 2018, 02:40
1
MathRevolution wrote:
[GMAT math practice question]

If \(gcd(m,n)\) is the greatest common divisor of \(m\) and \(n\), then \(n=?\)

1) \(gcd(m,n)=n\)
2) \(gcd(m,gcd(m,n))= 30\)


Statement 1:
Case 1: \(m=1\) and \(n=1\), with the result that \(gcd(m,n) = gcd(1,1) = 1\)
Case 2: \(m=2\) and \(n=2\), with the result that \(gcd(m,n) = gcd(2,2) = 2\)
Since \(n\) can be different values, INSUFFICIENT.

Statement 2:
Case 1: \(m=30\) and \(n=30\), with the result that \(gcd(m,n) = gcd(30,30) = 30\) and \(gcd(m,gcd(m,n)) = gcd(30,30) = 30\)
Case 2: \(m=30\) and \(n=60\), with the result that \(gcd(m,n) = gcd(30,60) = 30\) and \(gcd(m,gcd(m,n)) = gcd(30,30) = 30\)
Since n can be different values, INSUFFICIENT.

Statements combined:
Substituting \(gcd(m,n)=n\) into \(gcd(m,\)\(gcd(m,n)\)\() =30\), we get:
\(gcd(m,n)=30\).
Substituting \(gcd(m,n)=30\) into \(gcd(m,n)\)\(=n\), we get:
\(30 = n\).
SUFFICIENT.


_________________

GMAT and GRE Tutor
Over 1800 followers
Click here to learn more
GMATGuruNY@gmail.com
New York, NY
If you find one of my posts helpful, please take a moment to click on the "Kudos" icon.
Available for tutoring in NYC and long-distance.
For more information, please email me at GMATGuruNY@gmail.com.


Originally posted by GMATGuruNY on 11 Jul 2018, 02:32.
Last edited by GMATGuruNY on 11 Jul 2018, 02:40, edited 1 time in total.
Senior Manager
Senior Manager
avatar
S
Joined: 04 Aug 2010
Posts: 305
Schools: Dartmouth College
Re: If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post 11 Jul 2018, 02:33
1
workout wrote:
To find the value of n

Statement 1

\(gcd(m,n) = n\)

The values of m = 10, n = 0 satisfy the given statement.


Careful!
n=0 is not a valid case because 0 cannot be a divisor.
_________________

GMAT and GRE Tutor
Over 1800 followers
Click here to learn more
GMATGuruNY@gmail.com
New York, NY
If you find one of my posts helpful, please take a moment to click on the "Kudos" icon.
Available for tutoring in NYC and long-distance.
For more information, please email me at GMATGuruNY@gmail.com.

MBA Section Director
User avatar
D
Affiliations: GMATClub
Joined: 22 May 2017
Posts: 948
Concentration: Nonprofit
GPA: 4
WE: Engineering (Computer Software)
Re: If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post 11 Jul 2018, 03:44
GMATGuruNY wrote:
workout wrote:
To find the value of n

Statement 1

\(gcd(m,n) = n\)

The values of m = 10, n = 0 satisfy the given statement.


Careful!
n=0 is not a valid case because 0 cannot be a divisor.


Ahh, yes, you are correct. Thanks for catching that.
_________________

If you like my post press kudos +1

New project wSTAT(which Schools To Apply To?)

New - RC Butler - 2 RC's everyday

Math Revolution GMAT Instructor
User avatar
V
Joined: 16 Aug 2015
Posts: 6500
GMAT 1: 760 Q51 V42
GPA: 3.82
Premium Member
Re: If gcd(m,n) is the greatest common divisor of m and n, then n=?  [#permalink]

Show Tags

New post 15 Jul 2018, 05:55
=>
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 we have 2 variables (m and n) and 0 equations, C is most likely to be the answer. So, we should consider conditions 1) & 2) together first. After comparing the number of variables and the number of equations, we can save time by considering conditions 1) & 2) together first.

Conditions 1) & 2)
In general, gcd(m,n) = gcd(m,gcd(m,n)).
By condition 1), gcd(m,gcd(m,n)) = n.
Therefore, by condition 2), n = gcd(m,gcd(m,n)) = 30.
Both conditions, together, are sufficient.

Since this question is an integer question (one of the key question areas), CMT (Common Mistake Type) 4(A) of the VA (Variable Approach) method tells us that we should also check answers A and B.

Condition 1)
The condition that gcd(m,n) = n tells us only that m is a multiple of n.
Condition 1) is not sufficient.

Condition 2)

gcd(m,gcd(m,n)) = gcd(m,n) since m is a multiple of gcd(m,n).
Thus, gcd(m,n) = 30. But this does not allow us to determine a unique value of n.
Condition 2) is not sufficient.

Therefore, C is the answer.

Answer: C

Normally, in problems which require 2 equations, such as those in which the original conditions include 2 variables, or 3 variables and 1 equation, or 4 variables and 2 equations, each of conditions 1) and 2) provide an additional equation. In these problems, the two key possibilities are that C is the answer (with probability 70%), and E is the answer (with probability 25%). Thus, there is only a 5% chance that A, B or D is the answer. This occurs in common mistake types 3 and 4. Since C (both conditions together are sufficient) is the most likely answer, we save time by first checking whether conditions 1) and 2) are sufficient, when taken together. Obviously, there may be cases in which the answer is A, B, D or E, but if conditions 1) and 2) are NOT sufficient when taken together, the answer must be E.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
"Only $99 for 3 month Online Course"
"Free Resources-30 day online access & Diagnostic Test"
"Unlimited Access to over 120 free video lessons - try it yourself"

GMAT Club Bot
Re: If gcd(m,n) is the greatest common divisor of m and n, then n=? &nbs [#permalink] 15 Jul 2018, 05:55
Display posts from previous: Sort by

If gcd(m,n) is the greatest common divisor of m and n, then n=?

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.