Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 22 Oct 2012
Posts: 7

What is the greatest possible common divisor of two differen [#permalink]
Show Tags
22 Nov 2012, 10:22
1
This post received KUDOS
9
This post was BOOKMARKED
Question Stats:
70% (01:56) correct
30% (00:55) wrong based on 244 sessions
HideShow timer Statistics
What is the greatest possible common divisor of two different positive integers which are less than 144? A. 143 B. 142 C. 72 D. 71 E. 12 Can someone explain why the answer is 71 if we assume that the integers are 143 and 142?
Official Answer and Stats are available only to registered users. Register/ Login.
Last edited by Bunuel on 22 Nov 2012, 11:52, edited 2 times in total.
Renamed the topic and edited the question.



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7443
Location: Pune, India

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
23 Nov 2012, 20:57
4
This post received KUDOS
Expert's post
4
This post was BOOKMARKED
cv3t3l1na wrote: What is the greatest possible common divisor of two different positive integers which are less than 144?
A. 143 B. 142 C. 72 D. 71 E. 12
Can someone explain why the answer is 71 if we assume that the integers are 143 and 142? First of all, what is the greatest common divisor of 143 and 142? It is 1. You are looking for the common divisor. 142 and 143 will have no common divisor except 1. Think: 2 and 3 have GCD (greatest common divisor) of 1 2 and 4 have GCD of 2. 3 and 4 have GCD (greatest common divisor) of 1 So if you were to select 2 numbers less than 5 with the greatest GCD, you need to select 2 and 4, not 3 and 4. Now think: 143 = 11 * 13 The greatest possible divisor it will have with another number less than 144 will be either 11 or 13. Let's move on. 142 = 2*71 The greatest possible divisor it can have with another number less than 144 can be 71 (say, if the other selected integer is 71) Do you think another number less than 144 could have a GCD of greater than 71? No because when you split a number into two factors, one of them will be at least 2. If it is greater than 2, the other factor will obviously be less than 71. It's a very intuitive concept. Take some numbers to comprehend it fully. These posts will also be helpful: http://www.veritasprep.com/blog/2011/09 ... cormath/http://www.veritasprep.com/blog/2011/09 ... hpartii/
_________________
Karishma Veritas Prep  GMAT Instructor My Blog
Get started with Veritas Prep GMAT On Demand for $199
Veritas Prep Reviews



Intern
Joined: 25 Jun 2012
Posts: 36

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
02 Dec 2012, 17:21
The largest prime whose multiple of 2 is less than 144.
71 is prime.
71 * 2 < 144
there's your answer.



Manager
Status: *Lost and found*
Joined: 25 Feb 2013
Posts: 123
Location: India
Concentration: General Management, Technology
GPA: 3.5
WE: Web Development (Computer Software)

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
01 May 2013, 10:18
VeritasPrepKarishma wrote: cv3t3l1na wrote: What is the greatest possible common divisor of two different positive integers which are less than 144?
A. 143 B. 142 C. 72 D. 71 E. 12
Can someone explain why the answer is 71 if we assume that the integers are 143 and 142? First of all, what is the greatest common divisor of 143 and 142? It is 1. You are looking for the common divisor. 142 and 143 will have no common divisor except 1. Think: 2 and 3 have GCD (greatest common divisor) of 1 2 and 4 have GCD of 2. 3 and 4 have GCD (greatest common divisor) of 1 So if you were to select 2 numbers less than 5 with the greatest GCD, you need to select 2 and 4, not 3 and 4. Now think: 143 = 11 * 13 The greatest possible divisor it will have with another number less than 144 will be either 11 or 13. Let's move on. 142 = 2*71 The greatest possible divisor it can have with another number less than 144 can be 71 (say, if the other selected integer is 71) Do you think another number less than 144 could have a GCD of greater than 71? No because when you split a number into two factors, one of them will be at least 2. If it is greater than 2, the other factor will obviously be less than 71. It's a very intuitive concept. Take some numbers to comprehend it fully. These posts will also be helpful: http://www.veritasprep.com/blog/2011/09 ... cormath/http://www.veritasprep.com/blog/2011/09 ... hpartii/Just to confirm, the only reason 143 is not the answer is because of the fact that the question mentioned 'two different positive numbers' right?
_________________
Feed me some KUDOS! *always hungry*
My Thread : Recommendation Letters



Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 629

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
01 May 2013, 12:12
Quote: Just to confirm, the only reason 143 is not the answer is because of the fact that the question mentioned 'two different positive numbers' right? Let the two positive integers be a,b where both a,b<144. Now, let the required GCD be k. Thus, a = kM and b = kN, where M,N are positive integers and are not equal. If k = 143, then the only way a<144 is if M = 1.Similarly, even for b, N=1. But as M is not equal to N, this is an invalid option. The same for k=142 and 72.However, for k = 71, we can have M=1,N=2 OR M=2,N=1. D. If they wouldn't have mentioned that fact, we could have chosen the same value for M=N=1.
_________________
All that is equal and notDeep Dive Inequality
Hit and Trial for Integral Solutions



Manager
Status: *Lost and found*
Joined: 25 Feb 2013
Posts: 123
Location: India
Concentration: General Management, Technology
GPA: 3.5
WE: Web Development (Computer Software)

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
02 May 2013, 08:12
vinaymimani wrote: Quote: Just to confirm, the only reason 143 is not the answer is because of the fact that the question mentioned 'two different positive numbers' right? Let the two positive integers be a,b where both a,b<144. Now, let the required GCD be k. Thus, a = kM and b = kN, where M,N are positive integers and are not equal. If k = 143, then the only way a<144 is if M = 1.Similarly, even for b, N=1. But as M is not equal to N, this is an invalid option. The same for k=142 and 72.However, for k = 71, we can have M=1,N=2 OR M=2,N=1. D. If they wouldn't have mentioned that fact, we could have chosen the same value for M=N=1. Got it! as you said...if the numbers could have been same, we could have used 143 as both the integers and the GCD wud have been 143! Thanks Vinay!
_________________
Feed me some KUDOS! *always hungry*
My Thread : Recommendation Letters



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7443
Location: Pune, India

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
02 May 2013, 10:12
arpanpatnaik wrote: VeritasPrepKarishma wrote: cv3t3l1na wrote: What is the greatest possible common divisor of two different positive integers which are less than 144?
A. 143 B. 142 C. 72 D. 71 E. 12
Can someone explain why the answer is 71 if we assume that the integers are 143 and 142? First of all, what is the greatest common divisor of 143 and 142? It is 1. You are looking for the common divisor. 142 and 143 will have no common divisor except 1. Think: 2 and 3 have GCD (greatest common divisor) of 1 2 and 4 have GCD of 2. 3 and 4 have GCD (greatest common divisor) of 1 So if you were to select 2 numbers less than 5 with the greatest GCD, you need to select 2 and 4, not 3 and 4. Now think: 143 = 11 * 13 The greatest possible divisor it will have with another number less than 144 will be either 11 or 13. Let's move on. 142 = 2*71 The greatest possible divisor it can have with another number less than 144 can be 71 (say, if the other selected integer is 71) Do you think another number less than 144 could have a GCD of greater than 71? No because when you split a number into two factors, one of them will be at least 2. If it is greater than 2, the other factor will obviously be less than 71. It's a very intuitive concept. Take some numbers to comprehend it fully. These posts will also be helpful: http://www.veritasprep.com/blog/2011/09 ... cormath/http://www.veritasprep.com/blog/2011/09 ... hpartii/Just to confirm, the only reason 143 is not the answer is because of the fact that the question mentioned 'two different positive numbers' right? Yes, if the two numbers can be the same, then the numbers themselves will be the GCD and hence 143 will be the answer.
_________________
Karishma Veritas Prep  GMAT Instructor My Blog
Get started with Veritas Prep GMAT On Demand for $199
Veritas Prep Reviews



Intern
Joined: 11 Sep 2012
Posts: 7

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
03 May 2013, 13:28
I am not entirely sharp because of a day of studying, but isn't it just that 71 is the GCD of x and y because x and y would then be respectably 71 and 142? Nothing more nothing less.



GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15990

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
05 Jul 2014, 14:43
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources



Math Expert
Joined: 02 Sep 2009
Posts: 39702

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
05 Jul 2014, 14:58



GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15990

Re: What is the greatest possible common divisor of two differen [#permalink]
Show Tags
22 Aug 2015, 02:44
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: What is the greatest possible common divisor of two differen
[#permalink]
22 Aug 2015, 02:44







