Last visit was: 26 Apr 2024, 03:01 It is currently 26 Apr 2024, 03:01

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
SORT BY:
Kudos
User avatar
Senior Manager
Senior Manager
Joined: 21 Dec 2009
Posts: 337
Own Kudos [?]: 2444 [107]
Given Kudos: 20
Concentration: Entrepreneurship, Finance
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [72]
Given Kudos: 81609
Send PM
User avatar
Director
Director
Joined: 18 Jul 2010
Status:Apply - Last Chance
Affiliations: IIT, Purdue, PhD, TauBetaPi
Posts: 538
Own Kudos [?]: 360 [11]
Given Kudos: 15
Concentration: $ Finance $
Schools:Wharton, Sloan, Chicago, Haas
 Q50  V37
GPA: 4.0
WE 1: 8 years in Oil&Gas
Send PM
General Discussion
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [7]
Given Kudos: 81609
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
4
Kudos
3
Bookmarks
Expert Reply
Saurajm wrote:
But if a and b are both divisible of 6, means that both are even, therefore at least both of them should be divisible by 2.... I am right????? I do not understand why (1) is valid... thanks!!


Yes, both are divisible by 6, which means that they are divisible by 2 and 3.

Next, we have that \(a=6x\) and \(b=6y\).

Consider two cases:
1. \(x\) and \(y\) share some common factor >1: for example \(x=2\) and \(y=4\) then \(a=12\) and \(b=24\) --> \(GCD(a,b)=12>6\);
2. \(x\) and \(y\) DO NOT share any common factor >1: for example \(x=5\) and \(y=2\) then \(a=30\) and \(b=12\) --> \(GCD(a,b)=6\).

From (1) we have that --> \(x=2y+1\) --> \(x\) is one more than multiple of \(y\). For example: \(x=3\) and \(y=1\) OR \(x=5\) and \(y=2\) OR \(x=7\) and \(y=3\) ... as you can see in all these cases x and y do not share any common factor more than 1. Now, as we concluded above if \(x\) and \(y\) DO NOT share any common factor >1, then \(GCD(a,b)=6\).

Or another way: \(b=6y\) and \(a=6(2y+1)\). \(2y\) and \(2y+1\) are consecutive integers and consecutive integers do not share any common factor 1. As \(2y\) has all factors of \(y\) then \(y\) and \(2y+1\) also do not share any common factor but 1, which means that 6 must GCD of \(a\) and \(b\)

Similar questions to practice:
what-is-the-greatest-common-factor-of-x-and-y-1-x-and-y-are-109273.html
x-and-y-are-positive-integers-such-that-x-8y-12-what-is-the-126743.html

Hope it helps.
User avatar
Director
Director
Joined: 25 Apr 2012
Posts: 531
Own Kudos [?]: 2284 [5]
Given Kudos: 740
Location: India
GPA: 3.21
WE:Business Development (Other)
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
4
Kudos
1
Bookmarks
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b

What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?


Given a and b are positive integers divisible by 6

From st 1, we have a = 2b+ 6
b is of the form b= 6c where c is a positive integer

therefore we have a = 2*6c+6 ----> a= 6 (2c+1)
b= 6c

Now HCF of a and b will be 6 as
a= 2*3*(2c+1)
b=2*3
Only common factor is 6

So, Ans is A alone sufficient. We can remove options B, C and E as possible answers

Not st 2 says a= 3b
taking b = 6c we have a=18c

a= 2*3^2*c
b=2*3 c
HCF will be 2*3*c that is 6c

Now if c=1 then 6 is a the HCF of both a and b
but if c=2 then 12 is HCF
Since 2 ans choices are possible.

Ans will be A to this Question
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [2]
Given Kudos: 81609
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
2
Kudos
Expert Reply
svalan wrote:
Hi Bunuel, could you kindly elaborate on the following statement:

"x=2y+1 --> x and y do not share any factor >1, as if they were we would be able to factor out if from 2y+1. Sufficient."

I'm obviously missing some fundamental insight, but I don't understand why not being able to factor something out of the 2y+1 means that 6 is the GCD.

Thanks!


We have that \(a=6x\) and \(b=6y\).

Consider two cases:
1. \(x\) and \(y\) share some common factor >1: for example \(x=2\) and \(y=4\) then \(a=12\) and \(b=24\) --> \(GCD(a,b)=12>6\);
2. \(x\) and \(y\) DO NOT share any common factor >1: for example \(x=5\) and \(y=2\) then \(a=30\) and \(b=12\) --> \(GCD(a,b)=6\).

From (1) we have that --> \(x=2y+1\) --> \(x\) is one more than multiple of \(y\). For example: \(x=3\) and \(y=1\) OR \(x=5\) and \(y=2\) OR \(x=7\) and \(y=3\) ... as you can see in all these cases x and y do not share any common factor more than 1. Now, as we concluded above if \(x\) and \(y\) DO NOT share any common factor >1, then \(GCD(a,b)=6\).

Hope it's clear.
Board of Directors
Joined: 18 Jul 2015
Status:Emory Goizueta Alum
Posts: 3600
Own Kudos [?]: 5426 [2]
Given Kudos: 346
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
2
Kudos
Expert Reply
camilles wrote:
Thanks for the explanation.

Still I do not understand why statement 2 is not sufficient. My reasoning is this one:
- for 6 to be GCD(a,b) then "a" and "b" must be multiple of 6 but "a" must also be equal to b+6 right?
- The only way to have a=3b and a=b+6 is for b=3 and a=9. However as b/6 must result in an integer we know that "a" cannot be equal to 3b, hence it is enough to say that 6 is NOT the gcd of (a,b). Therefore statement 2 is sufficient to answer the question.

Can you please tell me where my reasoning is flawed?


Take b = 12, you will get a = 36.

Now try to calculate the HCF of a and b, you will get your answer, why B is insufficient. :)
avatar
Intern
Intern
Joined: 22 May 2013
Posts: 35
Own Kudos [?]: 34 [1]
Given Kudos: 10
Concentration: General Management, Technology
GPA: 3.9
WE:Information Technology (Computer Software)
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
1
Kudos
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b

What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?


Question:
6 * x =a and 6 * y =b
we need to find if 6 is the GCD? YES or NO question.
so, basically if we can find a single common factor in x and y, thats it its not a GCD, or if we cant find one then that should also work for us.

(1) a = 2b + 6

6x=12y + 6

x = 2y +1 =>No matter what you do, this will always result in an no common factor.

Thus 6 is the only GCD =>Sufficient

(2) a = 3b

6x = 18y
x=3y

Take y=8, and Y=2 =>This is clearly Not sufficient.

Ans: A
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [1]
Given Kudos: 81609
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
1
Bookmarks
Expert Reply
earnit wrote:
Bunuel wrote:
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b

What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?


If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

Given: \(a=6x\) and \(b=6y\). Question: is \(GCD(a,b)=6\)? Now, If \(x\) and \(y\) share any common factor >1then \(GCD(a,b)\) will be more than 6 if not then \(GCD(a,b)\) will be 6.

(1) \(a=2b+6\) --> \(6x=2*6y+6\) --> \(x=2y+1\) --> \(x\) and \(y\) do not share any factor >1, as if they were we would be able to factor out if from \(2y+1\). Sufficient.

(2) \(a=3b\) --> clearly insufficient.

Answer: A.

There is also a general rule: if \(a\) and \(b\) are multiples of \(k\) and are \(k\) units apart from each other then \(k\) is greatest common divisor of \(a\) and \(b\).

For example if \(a\) and \(b\) are multiples of 7 and \(a=b+7\) then 7 is GCD of \(a\) and \(b\).

So if we apply this rule to (1) \(a=2b+6\) --> both \(a\) and \(2b\) are multiples of 6 and are 6 apart, so GCD of \(a\) and \(2b\) is 6, hence GCD of \(a\) and \(b\) is also 6. Sufficient.

Hope it helps.


It would be great if one could find more questions involving GCD/GCF as they seem to be little tricky more often than not.


Check similar questions to practice:
what-is-the-greatest-common-factor-of-x-and-y-109273.html
x-and-y-are-positive-integers-such-that-x-8y-12-what-is-the-126743.html

DS Divisibility/Multiples/Factors questions to practice: search.php?search_id=tag&tag_id=354
PS Divisibility/Multiples/Factors questions to practice: search.php?search_id=tag&tag_id=185

For more browse our QUESTION BANKS.

Hope it helps.
Tutor
Joined: 16 Oct 2010
Posts: 14823
Own Kudos [?]: 64928 [1]
Given Kudos: 426
Location: Pune, India
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
1
Kudos
Expert Reply
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b


Recall that the GCD of two numbers must be a factor of their difference.
6 is a factor of a and b.

(1) a = 2b + 6

a - 2b = 6
This means that GCD of a and 2b is almost 6. Then GCD of a and b cannot be more than 6 either (because b has a subset of factors of 2b).
Since both a and b have 6 as a factor, 6 must be their GCD.
Sufficient.

(2) a = 3b
If a = 3b, we need the GCD of 3b and b. That will simply be 'b'. If b is 6, the GCD will be 6. If b is 12, the GCD will be 12 etc.
Not sufficient.

Answer (A)
avatar
Intern
Intern
Joined: 17 Aug 2011
Posts: 2
Own Kudos [?]: [0]
Given Kudos: 0
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
Hi Bunuel, could you kindly elaborate on the following statement:

"x=2y+1 --> x and y do not share any factor >1, as if they were we would be able to factor out if from 2y+1. Sufficient."

I'm obviously missing some fundamental insight, but I don't understand why not being able to factor something out of the 2y+1 means that 6 is the GCD.

Thanks!
avatar
Intern
Intern
Joined: 17 Aug 2011
Posts: 2
Own Kudos [?]: [0]
Given Kudos: 0
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
Crystal clear, thanks so much!
User avatar
Intern
Intern
Joined: 12 Nov 2011
Posts: 43
Own Kudos [?]: 97 [0]
Given Kudos: 24
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
Perfect explanation
avatar
Intern
Intern
Joined: 25 Aug 2011
Posts: 14
Own Kudos [?]: 5 [0]
Given Kudos: 56
Concentration: Entrepreneurship, General Management
GMAT Date: 01-31-2012
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
Bunuel wrote:
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b

What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?


If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

Given: \(a=6x\) and \(b=6y\). Question: is \(GCD(a,b)=6\)? Now, If \(x\) and \(y\) share any common factor >1then \(GCD(a,b)\) will be more than 6 if not then \(GCD(a,b)\) will be 6.

(1) \(a=2b+6\) --> \(6x=2*6y+6\) --> \(x=2y+1\) --> \(x\) and \(y\) do not share any factor >1, as if they were we would be able to factor out if from \(2y+1\). Sufficient.

(2) \(a=3b\) --> clearly insufficient.

Answer: A.

There is also a general rule: if \(a\) and \(b\) are multiples of \(k\) and are \(k\) units apart from each other then \(k\) is greatest common divisor of \(a\) and \(b\).

For example if \(a\) and \(b\) are multiples of 7 and \(a=b+7\) then 7 is GCD of \(a\) and \(b\).

So if we apply this rule to (1) \(a=2b+6\) --> both \(a\) and \(2b\) are multiples of 6 and are 6 apart, so GCD of \(a\) and \(2b\) is 6, hence GCD of \(a\) and \(b\) is also 6. Sufficient.

Hope it helps.


But if a and b are both divisible of 6, means that both are even, therefore at least both of them should be divisible by 2.... I am right????? I do not understand why (1) is valid... thanks!!
avatar
Manager
Manager
Joined: 26 Dec 2011
Posts: 78
Own Kudos [?]: 138 [0]
Given Kudos: 17
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
Hi Bunuel, Can you explain the following rule with few examples.

Given: and . Question: is ? Now, If x and y share any common factor >1then GCD (a,b) will be more than 6 if not then GCD (a,b) will be 6.
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [0]
Given Kudos: 81609
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
Expert Reply
pavanpuneet wrote:
Hi Bunuel, Can you explain the following rule with few examples.

Given: and . Question: is ? Now, If x and y share any common factor >1then GCD (a,b) will be more than 6 if not then GCD (a,b) will be 6.


Sure. Both \(a\) and \(b\) are multiples of 6 --> \(a=6x\) and \(b=6y\). Consider two cases:

A. \(x\) and \(y\) do not share any common factor >1, for example \(a=6*2=12\) and \(b=6*3=18\) --> GCD(a,b)=6. As you can see 2 and 3 did not contribute any common factor to the GCD;

B. \(x\) and \(y\) share some common factor >1, for example \(a=6*2=12\) and \(b=6*4=24\) --> GCD(a,b)=12, here 2 and 4 contributes common factor 2 to the GCD.

Hope it's clear.
User avatar
Manager
Manager
Joined: 13 Jun 2011
Status:Do till 740 :)
Posts: 61
Own Kudos [?]: 31 [0]
Given Kudos: 19
Concentration: Strategy, General Management
GMAT 1: 460 Q35 V20
GPA: 3.6
WE:Consulting (Computer Software)
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
Hi Bunuel,

Can you please explain

x and y do not share any factor >1, as if they were we would be able to factor out if from 2y+1. Sufficient.


so if we have x=2(2y+1) then x does have a factor of 2,but how do we know about the factors of y.
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619101 [0]
Given Kudos: 81609
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
Expert Reply
shankar245 wrote:
Hi Bunuel,

Can you please explain

x and y do not share any factor >1, as if they were we would be able to factor out if from 2y+1. Sufficient.


so if we have x=2(2y+1) then x does have a factor of 2,but how do we know about the factors of y.


x=2y+1 means that x and 2y are co-prime (x and 2y do not share any common factor but 1), which, on the other hand, means that x and y are co-prime. How else? If x and 2y do not share any common factor greater than 1, how can x and y share any common factor greater than 1?
User avatar
Manager
Manager
Joined: 06 Mar 2014
Posts: 166
Own Kudos [?]: 475 [0]
Given Kudos: 84
Location: India
GMAT Date: 04-30-2015
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the greatest com [#permalink]
Bunuel wrote:
gmatbull wrote:
If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

(1) a = 2b + 6

(2) a = 3b

What is the fastest (perhaps, algebra?) means of solving the question besides
random plugging numbers under test condition?


If a and b are positive integers divisible by 6, is 6 the greatest common divisor of a and b?

Given: \(a=6x\) and \(b=6y\). Question: is \(GCD(a,b)=6\)? Now, If \(x\) and \(y\) share any common factor >1then \(GCD(a,b)\) will be more than 6 if not then \(GCD(a,b)\) will be 6.

(1) \(a=2b+6\) --> \(6x=2*6y+6\) --> \(x=2y+1\) --> \(x\) and \(y\) do not share any factor >1, as if they were we would be able to factor out if from \(2y+1\). Sufficient.

(2) \(a=3b\) --> clearly insufficient.

Answer: A.

There is also a general rule: if \(a\) and \(b\) are multiples of \(k\) and are \(k\) units apart from each other then \(k\) is greatest common divisor of \(a\) and \(b\).

For example if \(a\) and \(b\) are multiples of 7 and \(a=b+7\) then 7 is GCD of \(a\) and \(b\).

So if we apply this rule to (1) \(a=2b+6\) --> both \(a\) and \(2b\) are multiples of 6 and are 6 apart, so GCD of \(a\) and \(2b\) is 6, hence GCD of \(a\) and \(b\) is also 6. Sufficient.

Hope it helps.


It would be great if one could find more questions involving GCD/GCF as they seem to be little tricky more often than not.
Manager
Manager
Joined: 20 Apr 2014
Posts: 70
Own Kudos [?]: 16 [0]
Given Kudos: 50
Send PM
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
If x and 2y do not share any common factor greater than 1, how can x and y share any common factor greater than 1?
Please Bunuel clarify this comment more. what does it mean.
another question is that how frequently DS questions of divisibility come in GMAT test ?
GMAT Club Bot
Re: If a and b are positive integers divisible by 6, is 6 the [#permalink]
 1   2   
Moderator:
Math Expert
92929 posts

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