Refer to my post here:
https://www.beatthegmat.com/gmatprep-dou ... 22395.html
Let me know if u have questions.
Modulus problem
This topic has expert replies
Source: Beat The GMAT — Data Sufficiency |
-
gmat009
- Master | Next Rank: 500 Posts
- Posts: 458
- Joined: Sun Aug 31, 2008 10:44 am
- Thanked: 3 times
- Followed by:1 members
I have read Ian's post but just thinking if someone comes up with different approachcramya wrote:Refer to my post here:
https://www.beatthegmat.com/gmatprep-dou ... 22395.html
Let me know if u have questions.
-
gmat009
- Master | Next Rank: 500 Posts
- Posts: 458
- Joined: Sun Aug 31, 2008 10:44 am
- Thanked: 3 times
- Followed by:1 members
No , I think Ian posted solution to this problem somewhere and he also used absolute method.cramya wrote:U mean my post correct?? Ian has not posted yet and may be we can request him to see if he can suggest us other alternatives for approaching thsi problem.
I am not having link to this problem
- logitech
- Legendary Member
- Posts: 2134
- Joined: Mon Oct 20, 2008 11:26 pm
- Thanked: 237 times
- Followed by:25 members
- GMAT Score:730
a---1--------y-----2------z-------3---------bgmat009 wrote:If a<y<z<b , is |y-a| < |y-b|
a) |z-a| < |z-b|
b) |y-a| < |z-b|
Between these 4 points, there are three distances: 1, 2 and 3
Question : Is 1 < 2+3 ?
St 1)
1+2 < 3
well if 3 is bigger than 1+2, 3+2 will be definetly bigger than 1 - SUF
St 2)
1 < 3 ; same logic, if 3 is bigger than 1, 3+2 is bigger than 1 - SUF
Hence, D
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
The method mention by you is the best and most simple.cramya wrote:U mean my post correct?? Ian has not posted yet and may be we can request him to see if he can suggest us other alternatives for approaching thsi problem.
No other method will give you results in 1min.
- logitech
- Legendary Member
- Posts: 2134
- Joined: Mon Oct 20, 2008 11:26 pm
- Thanked: 237 times
- Followed by:25 members
- GMAT Score:730
NO OTHER METHOD is a very strong phrase for arguments STOP:stop@800 wrote:The method mention by you is the best and most simple.cramya wrote:U mean my post correct?? Ian has not posted yet and may be we can request him to see if he can suggest us other alternatives for approaching thsi problem.
No other method will give you results in 1min.
mine takes only 23 seconds!
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
-
cramya
- Legendary Member
- Posts: 2467
- Joined: Thu Aug 28, 2008 6:14 pm
- Thanked: 331 times
- Followed by:11 members
Mine took 22.99999999999 secsmine takes only 23 seconds!
Thats a nice approach too! Essentially we have done the same thing; u have used numbers and pictures and I have used words to explain.
Good luck!
your method is same as what cramya did.logitech wrote:NO OTHER METHOD is a very strong phrase for arguments STOP:stop@800 wrote:The method mention by you is the best and most simple.cramya wrote:U mean my post correct?? Ian has not posted yet and may be we can request him to see if he can suggest us other alternatives for approaching thsi problem.
No other method will give you results in 1min.
mine takes only 23 seconds!












