How many ordered pairs of positive integers (x, y) satisfy 2x + 3y < 18 ?
Five fresh questions every day, your progress tracked, every miss explained. Free with an account.
PrepLattice is an independent test-preparation service and is not affiliated with or endorsed by GMAC, the organization that administers the GMAT. GMAT and GMAT Focus are trademarks of GMAC, used here only to name the exam this question is designed to prepare you for.
How many ordered pairs of positive integers (x, y) satisfy 2x + 3y < 18 ?
Five fresh questions every day, your progress tracked, every miss explained. Free with an account.
Correct answer
C
For each positive integer x, y must be a positive integer with y < (18 - 2x)/3. Count per row: x = 1 gives y < 5.33 so 5 values; x = 2 gives y < 4.67 so 4; x = 3 gives y < 4 so 3 (the strict bound excludes y = 4); x = 4 gives y < 3.33 so 3; x = 5 gives y < 2.67 so 2; x = 6 gives y < 2 so 1; x = 7 gives y < 1.33 so 1; x = 8 and beyond give none. Total = 5 + 4 + 3 + 3 + 2 + 1 + 1 = 19.
The false summit (D, 21) reads the strict < as ≤, wrongly admitting the boundary pairs (3, 4) and (6, 2); the strict-vs-inclusive boundary at each row is the load-bearing discipline.
Pick the theme that suits how you work. You can change it anytime.