Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 24 Jun 2016, 22:59

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the greatest common divisor of two different

Author Message
Manager
Joined: 01 Nov 2007
Posts: 101
Followers: 1

Kudos [?]: 41 [0], given: 0

What is the greatest common divisor of two different [#permalink]

### Show Tags

15 Mar 2008, 01:19
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

What is the greatest common divisor of two different positive integers which are less 144?

CEO
Joined: 17 Nov 2007
Posts: 3580
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 484

Kudos [?]: 2794 [0], given: 359

### Show Tags

15 Mar 2008, 01:30
Expert's post
71 (142 and 71)
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Manager
Joined: 01 Nov 2007
Posts: 101
Followers: 1

Kudos [?]: 41 [0], given: 0

### Show Tags

15 Mar 2008, 03:30
walker, I know the answer. What is more interesting for me is approach.
CEO
Joined: 17 Nov 2007
Posts: 3580
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 484

Kudos [?]: 2794 [0], given: 359

### Show Tags

15 Mar 2008, 05:15
Expert's post
This is my logic:

1. we have two different integers.
2. the largest GCD(x,y) of two integers when GCD(x,y)=x
3. if we choose one integer (x), the most closest different integer to give GCD=x is y=2x
4. apply for our problem: the largest integer in the set is 143 but 143 is odd. Therefore, we choose next one - 142 and 142/2=71.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Manager
Joined: 01 Nov 2007
Posts: 101
Followers: 1

Kudos [?]: 41 [0], given: 0

### Show Tags

15 Mar 2008, 05:52
Thanks for clear explanation!
Manager
Joined: 15 Mar 2008
Posts: 51
Followers: 1

Kudos [?]: 21 [0], given: 0

### Show Tags

15 Mar 2008, 18:20
az780 wrote:
What is the greatest common divisor of two different positive integers which are less 144?

71 is a divisor for 71 and for 142.
rkassal
Re: PS (GCD)   [#permalink] 15 Mar 2008, 18:20
Display posts from previous: Sort by