BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Modulus problem

Expert replies
Source: — Data Sufficiency |

by cramya » Sat Nov 15, 2008 9:55 pm
Refer to my post here:

https://www.beatthegmat.com/gmatprep-dou ... 22395.html

Let me know if u have questions.
Join the discussion

by gmat009 » Sat Nov 15, 2008 10:03 pm
cramya wrote:Refer to my post here:

https://www.beatthegmat.com/gmatprep-dou ... 22395.html

Let me know if u have questions.
I have read Ian's post but just thinking if someone comes up with different approach
Join the discussion

by cramya » Sat Nov 15, 2008 10:10 pm
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.
Join the discussion

by gmat009 » Sat Nov 15, 2008 10:19 pm
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 , I think Ian posted solution to this problem somewhere and he also used absolute method.
I am not having link to this problem
Join the discussion

Re: Modulus problem

by logitech » Sat Nov 15, 2008 10:25 pm
gmat009 wrote:If a<y<z<b , is |y-a| < |y-b|

a) |z-a| < |z-b|
b) |y-a| < |z-b|
a---1--------y-----2------z-------3---------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!"
Join the discussion

by stop@800 » Sat Nov 15, 2008 10:34 pm
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.
The method mention by you is the best and most simple.
No other method will give you results in 1min.
Join the discussion

by logitech » Sat Nov 15, 2008 10:44 pm
stop@800 wrote:
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.
The method mention by you is the best and most simple.
No other method will give you results in 1min.
NO OTHER METHOD is a very strong phrase for arguments STOP:


mine takes only 23 seconds! :D
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion

by cramya » Sat Nov 15, 2008 10:50 pm
mine takes only 23 seconds!
Mine took 22.99999999999 secs :-) Explanation longer.

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!
Join the discussion

by stop@800 » Sun Nov 16, 2008 2:18 am
logitech wrote:
stop@800 wrote:
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.
The method mention by you is the best and most simple.
No other method will give you results in 1min.
NO OTHER METHOD is a very strong phrase for arguments STOP:


mine takes only 23 seconds! :D
your method is same as what cramya did.
:)
Join the discussion