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
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget 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.

knewton, error in question?

Expert replies
by qwe12 » Mon Aug 02, 2010 10:52 pm
Question #23 (correct)
Right triangle LMN is to be constructed in the xy-plane so that the right angle is at point L and LM is parallel to the x-axis. The x- and y- coordinates of L, M, and N are to be integers that satisfy the inequalities -3 < x < 4 and 3 < y < 11. How many different triangles with these properties could be constructed?


(A) 72

(B) 576

(C) 4032 your answer correct

(D) 4608

(E) 6336
Explanation
We are asked to find out how many possible triangles could exist within an area on the xy-plane horizontally bounded by x = -3 and x = 4 (8 possible integer values of x, including 0) and by y = 3 and y = 11 vertically (9 possible integer values). Point L lies on one of the points within this rectangular area, which means that L can lie in any one of 72 possible points (8 x 9).

Because we know that LM is parallel to the x-axis (a horizontal line), we know that point M always has the same y-value as L. We do not know the orientation of the triangle, so point M could be either to the left or right of point L on the plane, meaning that it could lie on any point on the same horizontal line as L, within the boundaries of the problem, except the point on which L already lies. This means that there are 7 possible values of point M for every point that L lies on. We can thus multiply the 72 possible values of L with the 7 possible values of M to get all the possible placements of L and M: 504.

********** POSSIBLE ERROR
********** So shouldn't this be 8 possible values for point M? So 72 * 8 instead of 72* 7?
********** POSSIBLE ERROR

Every one of these possible triangles has a right angle at L, which means that point N has the same x-coordinate as L. However, it could be above or below L, and can thus be in any of 8 different points within the boundaries (the 9 possible y-values minus the one on which point L lies). This means that for every combination of L and M, there are 8 different triangles that can be made. We multiply 504 by 8 to get 4032.

Answer choice C is correct.
Join the discussion
Source: — Problem Solving |

by Ian Stewart » Mon Aug 02, 2010 11:11 pm
qwe12 wrote:Question #23 (correct)
Right triangle LMN is to be constructed in the xy-plane so that the right angle is at point L and LM is parallel to the x-axis. The x- and y- coordinates of L, M, and N are to be integers that satisfy the inequalities -3 < x < 4 and 3 < y < 11. How many different triangles with these properties could be constructed?


(A) 72

(B) 576

(C) 4032 your answer correct

(D) 4608

(E) 6336
Explanation
We are asked to find out how many possible triangles could exist within an area on the xy-plane horizontally bounded by x = -3 and x = 4 (8 possible integer values of x, including 0) and by y = 3 and y = 11 vertically (9 possible integer values). Point L lies on one of the points within this rectangular area, which means that L can lie in any one of 72 possible points (8 x 9).

Because we know that LM is parallel to the x-axis (a horizontal line), we know that point M always has the same y-value as L. We do not know the orientation of the triangle, so point M could be either to the left or right of point L on the plane, meaning that it could lie on any point on the same horizontal line as L, within the boundaries of the problem, except the point on which L already lies. This means that there are 7 possible values of point M for every point that L lies on. We can thus multiply the 72 possible values of L with the 7 possible values of M to get all the possible placements of L and M: 504.

********** POSSIBLE ERROR
********** So shouldn't this be 8 possible values for point M? So 72 * 8 instead of 72* 7?
********** POSSIBLE ERROR

Every one of these possible triangles has a right angle at L, which means that point N has the same x-coordinate as L. However, it could be above or below L, and can thus be in any of 8 different points within the boundaries (the 9 possible y-values minus the one on which point L lies). This means that for every combination of L and M, there are 8 different triangles that can be made. We multiply 504 by 8 to get 4032.

Answer choice C is correct.
That looks okay to me. While there are 8 different possible integer values of x in the range -3 < x < 4, once we've chosen a location for point L, we can't put M in the same place as L. That leaves only seven remaining values for the x coordinate of M.
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
Join the discussion

by sandysai » Wed Aug 04, 2010 7:15 pm
Hi

One basic question;

Given question "The satisfy the inequalities -3 < x < 4 and 3 < y < 11. How many different triangles with these properties could be constructed? "

The possible values of X = (-2,-1,0,1,2,3) --> That is 6 possible values.. isn't it ? How was 8 derived at.
Join the discussion

by Ian Stewart » Wed Aug 04, 2010 9:32 pm
sandysai wrote:Hi

One basic question;

Given question "The satisfy the inequalities -3 < x < 4 and 3 < y < 11. How many different triangles with these properties could be constructed? "

The possible values of X = (-2,-1,0,1,2,3) --> That is 6 possible values.. isn't it ? How was 8 derived at.
I'm guessing, reading the solution, that there was a typo in the original post; those '<' symbols are surely supposed to be '<' symbols.
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
Join the discussion

by qwe12 » Wed Aug 04, 2010 10:15 pm
Ian Stewart wrote:
sandysai wrote:Hi

One basic question;

Given question "The satisfy the inequalities -3 < x < 4 and 3 < y < 11. How many different triangles with these properties could be constructed? "

The possible values of X = (-2,-1,0,1,2,3) --> That is 6 possible values.. isn't it ? How was 8 derived at.
I'm guessing, reading the solution, that there was a typo in the original post; those '<' symbols are surely supposed to be '<' symbols.
yes, ian there was a typo. a copy paste error. it must be <=. thx
Join the discussion