GMATprep Geometry question

This topic has expert replies
Source: — Problem Solving |

Master | Next Rank: 500 Posts
Posts: 141
Joined: Thu May 03, 2007 1:15 pm

by drhomler » Sat Jun 16, 2007 5:06 pm
If you take each tick mark and break and find the lowest common denominator than put them in numerical order and you will quickly see 20/35 and 21/35 come up in the ordering which is the smallest space between the hash marks

Junior | Next Rank: 30 Posts
Posts: 23
Joined: Tue May 15, 2007 6:13 pm

by axisymmetric » Sat Jun 16, 2007 5:18 pm
Thank you sir! That helps :)

Senior | Next Rank: 100 Posts
Posts: 69
Joined: Wed Apr 25, 2007 1:38 am
Followed by:1 members

by discreet » Mon Jun 18, 2007 5:59 am
I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D

Junior | Next Rank: 30 Posts
Posts: 11
Joined: Tue Jun 19, 2007 6:10 am

by vmahalin » Tue Jun 19, 2007 8:36 am
The least possible distance can only be between the smaller tick mark (sevenths) and the longer tick mark (fifths). There is no trick in solving this, just use first principles. Start from zero, the distance between zero and the first seventh tick mark is 1/7. Similarly 1/5, from zero to the first fifth tick mark. Subtract 1/5 -1/7 = 2/35 is the answer

Master | Next Rank: 500 Posts
Posts: 174
Joined: Mon Mar 26, 2007 5:51 am
Thanked: 1 times

by 800GMAT » Tue Jun 19, 2007 10:06 am
Consider the total length=35 and then divide the length as per the question.

Master | Next Rank: 500 Posts
Posts: 172
Joined: Wed Oct 31, 2007 11:21 am
Thanked: 1 times

by gmattester » Sun Aug 24, 2008 6:56 pm
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 am
Location: Montreal
Thanked: 1090 times
Followed by:355 members
GMAT Score:780

by Ian Stewart » Sun Aug 24, 2008 8:56 pm
gmattester wrote:
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic
It's not likely you'll see this exact type of question again, but the method is correct, although discreet surely means the LCM, not the GCD. I'll only prove it if someone asks, though; the proof is a bit abstract. On the GMAT, you would not be expected to know this kind of fact- for this question, it's easy enough to write down all of the fractions with a common denominator, 35:

5/35, 7/35, 10/35, 14/35, 15/35, 20/35, 21/35, 25/35, 28/35, 30/35

and you can see all the possible distances that way.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com

Master | Next Rank: 500 Posts
Posts: 172
Joined: Wed Oct 31, 2007 11:21 am
Thanked: 1 times

by gmattester » Sun Aug 24, 2008 9:29 pm
Ian Stewart wrote:
gmattester wrote:
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic
It's not likely you'll see this exact type of question again, but the method is correct, although discreet surely means the LCM, not the GCD. I'll only prove it if someone asks, though; the proof is a bit abstract. On the GMAT, you would not be expected to know this kind of fact- for this question, it's easy enough to write down all of the fractions with a common denominator, 35:

5/35, 7/35, 10/35, 14/35, 15/35, 20/35, 21/35, 25/35, 28/35, 30/35

and you can see all the possible distances that way.
Thanks Ian.....
Much clear now.

Legendary Member
Posts: 1161
Joined: Mon May 12, 2008 2:52 am
Location: Sydney
Thanked: 23 times
Followed by:1 members

by mehravikas » Sun Aug 24, 2008 10:13 pm
I have been preparing for GMAT and I have finished OG, Kaplan, PR. I just gave a GMAT prep yesterday, and to be honest could get only 21 questions correct in quant. I have always scored more than 80% on all the gmat practice material. But I guess Gmat prep is entierly different from Kaplan (way too tough), PR and OG (too easy).

Would you recommend more practice to these kind of questions or some other material???
gmattester wrote:
Ian Stewart wrote:
gmattester wrote:
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic
It's not likely you'll see this exact type of question again, but the method is correct, although discreet surely means the LCM, not the GCD. I'll only prove it if someone asks, though; the proof is a bit abstract. On the GMAT, you would not be expected to know this kind of fact- for this question, it's easy enough to write down all of the fractions with a common denominator, 35:

5/35, 7/35, 10/35, 14/35, 15/35, 20/35, 21/35, 25/35, 28/35, 30/35

and you can see all the possible distances that way.
Thanks Ian.....
Much clear now.

Legendary Member
Posts: 829
Joined: Mon Jul 07, 2008 10:09 pm
Location: INDIA
Thanked: 84 times
Followed by:3 members

by sudhir3127 » Sun Aug 24, 2008 10:17 pm
mehravikas wrote:I have been preparing for GMAT and I have finished OG, Kaplan, PR. I just gave a GMAT prep yesterday, and to be honest could get only 21 questions correct in quant. I have always scored more than 80% on all the gmat practice material. But I guess Gmat prep is entierly different from Kaplan (way too tough), PR and OG (too easy).

Would you recommend more practice to these kind of questions or some other material???
gmattester wrote:
Ian Stewart wrote:
gmattester wrote:
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic
It's not likely you'll see this exact type of question again, but the method is correct, although discreet surely means the LCM, not the GCD. I'll only prove it if someone asks, though; the proof is a bit abstract. On the GMAT, you would not be expected to know this kind of fact- for this question, it's easy enough to write down all of the fractions with a common denominator, 35:

5/35, 7/35, 10/35, 14/35, 15/35, 20/35, 21/35, 25/35, 28/35, 30/35

and you can see all the possible distances that way.
Thanks Ian.....
Much clear now.
Request you to please post ur question on an appropriate thread.. i am sure u will get the answers quickly and in more organised way...

thanks

Legendary Member
Posts: 1161
Joined: Mon May 12, 2008 2:52 am
Location: Sydney
Thanked: 23 times
Followed by:1 members

by mehravikas » Mon Aug 25, 2008 1:49 am
Thanks Sudhir. You can view my thread on https://www.beatthegmat.com/help-needed- ... 16976.html
sudhir3127 wrote:
mehravikas wrote:I have been preparing for GMAT and I have finished OG, Kaplan, PR. I just gave a GMAT prep yesterday, and to be honest could get only 21 questions correct in quant. I have always scored more than 80% on all the gmat practice material. But I guess Gmat prep is entierly different from Kaplan (way too tough), PR and OG (too easy).

Would you recommend more practice to these kind of questions or some other material???
gmattester wrote:
Ian Stewart wrote:
gmattester wrote:
discreet wrote:I think we can generalize this....the Lowest distance should be the GCD\HCF of the two numbers 5 and 7 = 35...
So,lowest possible distance is 1/35....you can test it with any no. of options to satisfy yrself and then perform the test that drholmer has given :wink: ....eg: 2 and 5 parts , 6 and 7 parts, 3 and 4 parts etc etc :D
Can someone verify this method...
Or if someone has shorter method to solve this question with proper logic
It's not likely you'll see this exact type of question again, but the method is correct, although discreet surely means the LCM, not the GCD. I'll only prove it if someone asks, though; the proof is a bit abstract. On the GMAT, you would not be expected to know this kind of fact- for this question, it's easy enough to write down all of the fractions with a common denominator, 35:

5/35, 7/35, 10/35, 14/35, 15/35, 20/35, 21/35, 25/35, 28/35, 30/35

and you can see all the possible distances that way.
Thanks Ian.....
Much clear now.
Request you to please post ur question on an appropriate thread.. i am sure u will get the answers quickly and in more organised way...

thanks