Study guide
8.4 Age Problems & Discrete Optimization
GMAT Quantitative Reasoning Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Adaptive Scoring & Problem Solving Fundamentals
1.1 GMAT Focus Quant Overview & Question Mechanics 1.2 Mental Math, Estimation & Non-Calculator Strategies 1.3 Problem Solving Strategies & Elimination Techniques
2 Chapter 2: Number Theory & Integer Properties
2.1 Divisibility Rules, Prime Factorization & Factors 2.2 Greatest Common Factor (GCF) & Least Common Multiple (LCM) 2.3 Division Algorithm & Remainder Arithmetic 2.4 Parity, Signs & Consecutive Integer Properties 2.5 Real Numbers, the Number Line & Properties of Operations
3 Chapter 3: Fractions, Decimals, Ratios & Percentages
3.1 Fraction Arithmetic & Operations 3.2 Decimals, Place Value & Terminating Decimals 3.3 Ratios, Proportions & Variation 3.4 Percentages, Percent Change, Markup & Profit
4 Chapter 4: Exponents, Roots & Radical Expressions
4.1 Laws of Exponents & Exponential Equations 4.2 Radicals & Operations with Roots 4.3 Exponent & Root Inequalities and Traps
5 Chapter 5: Algebraic Expressions, Equations & Inequalities
5.1 Algebraic Manipulation & Special Products 5.2 Linear Equations & Systems of Equations 5.3 Quadratic Equations, Roots & Factoring 5.4 Inequalities, Sign Charts & Absolute Value 5.5 Formulas, Units & Measurement Conversion
6 Chapter 6: Coordinate Geometry & Linear Functions
6.1 The Coordinate Plane, Distance & Midpoint 6.2 Slope, Equations of Lines & Intercepts 6.3 Functions, Notation & Transformations
7 Chapter 7: Rates, Work, Motion & Mixture Word Problems
7.1 Uniform Motion: Rate, Time & Distance 7.2 Relative Speed, Catch-Up & Current/Wind Problems 7.3 Work-Rate & Cooperative Labor 7.4 Mixture & Weighted Average Word Problems
8 Chapter 8: Applied Word Problems, Sets & Sequences
8.1 Overlapping Sets & Venn Diagrams 8.2 Arithmetic & Geometric Sequences 8.3 Simple & Compound Interest Calculations 8.4 Age Problems & Discrete Optimization
9 Chapter 9: Descriptive Statistics & Data Distributions
9.1 Mean, Median & Mode 9.2 Range, Variance & Standard Deviation 9.3 Frequency Distributions & Distribution Properties
10 Chapter 10: Permutations, Combinations & Probability
10.1 Fundamental Counting Principle & Factorials 10.2 Combinations, Permutations & Grouping 10.3 Probability Rules: Independent & Dependent Events 10.4 Complementary Probability & Multi-Stage Events
8.4 Age Problems & Discrete Optimization
Key Takeaways Explain This Topic AI
Everyone ages at the same rate, so the difference between two people's ages is invariant. Assign variables at one reference time and shift that time by adding or subtracting the elapsed years.
Age ratios change even though differences do not. Translate each clause to the time it names: 'in 5 years' is present plus 5, and '3 years ago' is present minus 3.
To maximize one integer in a constrained set, minimize every other integer to the smallest value the constraints still allow (distinctness, positivity, median, or upper bound).
To minimize the largest integer, pack the values as close together as the constraints allow — usually consecutive or near-consecutive integers around the mean.
Worst-case (pigeonhole) guarantee questions add 1 to the maximum number of draws that still fail the target condition.
Last updated: August 2026
Age problems are algebraic translation, the same skill Official Guide Math Review 3.2 tests with linear equations. Discrete-optimization items — greatest possible , least possible , minimum number that guarantees — are integer cousins of the overlap bounds in Section 8.1. Both appear as Problem Solving word problems on the 21-question, 45-minute, no-calculator Quantitative Reasoning section.
Age Problems: One Clock, Constant Differences
Every living person ages at the same rate of one year per year. Two consequences follow, and both are tested:
The difference between two people's ages never changes.
The ratio of their ages does change. As years pass, any two positive ages drift toward a ratio of 1 1 1 .
The reliable setup is to pick one reference time (almost always now ), assign a variable to each person at that time, and express every other epoch by adding or subtracting the same elapsed years from every person.
- Person k k k years ago Now m m m years from now
- A A A A − k A - k A − k A A A A + m A + m A + m
- B B B B − k B - k B − k B B B B + m B + m B + m
- Difference A − B A - B A − B A − B A - B A − B A − B A - B A − B A − B A - B A − B
Do not introduce a second independent variable for the same person at a second time. "Priya in five years" is P + 5 P + 5 P + 5 , not a new letter. Mixing clocks is the source of most age-algebra errors.
Translation examples:
"In 5 5 5 years, Arthur will be twice as old as Brenda was 3 3 3 years ago" → A + 5 = 2 ( B − 3 ) \to A + 5 = 2(B - 3) → A + 5 = 2 ( B − 3 ) .
"When Chris was born, Diana was already 6 6 6 " → D − C = 6 \to D - C = 6 → D − C = 6 .
"Four years ago, Marcus was 5 5 5 times as old as Leo" → M − 4 = 5 ( L − 4 ) \to M - 4 = 5(L - 4) → M − 4 = 5 ( L − 4 ) .
After writing one equation per time-clause, substitute. Ages must come out positive and, on the GMAT, almost always integers. If a candidate value makes a past age zero or negative, reject it.
A useful sanity check: if the present ages are M M M and L L L with M > L M > L M > L , then M − L M - L M − L must equal the difference implied by every epoch in the stem. If the past equation and the future equation produce two different differences, the algebra is wrong.
Discrete Optimization: Extreme Allocation
A typical GMAT prompt gives a sum, a mean, a median, and a distinct-positive-integer constraint, then asks for the greatest possible value of the largest term — or the least possible value of the largest term. Integers cannot take fractional values, and "distinct" forbids repeats.
Rules:
Maximize the largest x n x_n x n . Minimize every other x i x_i x i to the smallest legal integer (often 1 , 2 , 3 , … 1, 2, 3, \ldots 1 , 2 , 3 , … , subject to a fixed median).
Minimize the largest x n x_n x n (minimax). Pack the list as close together as possible, usually consecutive integers around the mean S / n S/n S / n .
Minimize the smallest x 1 x_1 x 1 . Maximize the other terms up to any stated cap.
Maximize the smallest x 1 x_1 x 1 (maximin). Again pack near the mean.
Median handling: for an odd count, the middle position is locked to the stated median. For an even count of 6 6 6 , the median is the average of x 3 x_3 x 3 and x 4 x_4 x 4 , so x 3 + x 4 x_3 + x_4 x 3 + x 4 is twice the median. To maximize x 6 x_6 x 6 you still minimize x 1 , x 2 , x 5 x_1, x_2, x_5 x 1 , x 2 , x 5 and, subject to x 3 < x 4 x_3 < x_4 x 3 < x 4 and x 3 + x 4 x_3 + x_4 x 3 + x 4 fixed, you take the split that then allows the smallest x 5 x_5 x 5 .
Integer Products and Sums
A second family asks for the greatest product of positive integers with a fixed sum, or the least sum of positive integers with a fixed product.
For a fixed sum S S S of two positive integers, the product x ( S − x ) x(S - x) x ( S − x ) is maximized when x x x is as close as possible to S / 2 S/2 S /2 . If repeats are forbidden, use the nearest distinct pair (for S = 10 S = 10 S = 10 , 4 × 6 = 24 4 \times 6 = 24 4 × 6 = 24 rather than 5 × 5 = 25 5 \times 5 = 25 5 × 5 = 25 ).
For a fixed product, the sum is minimized when the factors are as equal as possible (and usually near 3 3 3 if unrestricted partitions are allowed). GMAT stems nearly always restrict to two or three named positive integers, so equal-as-possible is enough.
If the product of two positive integers is 36 36 36 and repeats are allowed, the least sum is 6 + 6 = 12 6 + 6 = 12 6 + 6 = 12 . If they must be distinct, 4 + 9 = 13 4 + 9 = 13 4 + 9 = 13 is the next candidate to check against 3 + 12 = 15 3 + 12 = 15 3 + 12 = 15 and 2 + 18 = 20 2 + 18 = 20 2 + 18 = 20 .
Always enforce the stated type: positive versus nonnegative, distinct versus repeats allowed, even versus odd. A beautiful fractional split is not an answer if the stem demands integers.
Worst-Case Guarantees (Pigeonhole Counting)
Prompts that ask for the minimum number that guarantees an outcome are not probability questions. They are worst-case counts: Guaranteed selections = ( maximum unlucky selections ) + 1 \text{Guaranteed selections} = (\text{maximum unlucky selections}) + 1 Guaranteed selections = ( maximum unlucky selections ) + 1
Protocol:
Name the target (at least k k k of one color; at least one matching pair).
Take as many items as possible while still missing the target: all of every non-target type, plus k − 1 k - 1 k − 1 of the target type, or one from each category if the target is a matching pair.
Add 1 1 1 . The next draw is forced.
High-yield patterns:
At least k k k of color X X X , with other colors present: draw every non- X X X item, then k k k of color X X X .
At least k k k of some color, with four colors available: draw k − 1 k - 1 k − 1 of each color, then one more.
At least one matching pair from C C C categories: draw C + 1 C + 1 C + 1 .
Respect inventory caps. You cannot draw 9 9 9 red items from a box that contains only 8 8 8 red items; the worst case is limited by what the box actually holds.
Framework Table
- Goal Strategy for the other values Typical GMAT wording
- Maximize the largest Minimize the rest "greatest possible value of the largest"
- Minimize the largest Pack near the mean "least possible value of the largest"
- Maximize a product at fixed sum Split as evenly as allowed "greatest possible product"
- Minimize a sum at fixed product Split as evenly as allowed "least possible sum"
Guarantee an outcome Exhaust the unlucky draws, then + 1 +1 + 1 "minimum number that must be selected to guarantee"
Worked Example: Two-Epoch Ages
Four years ago, Marcus was 5 5 5 times as old as Leo. In 6 6 6 years, Marcus will be 3 3 3 times as old as Leo. Let M M M and L L L be present ages. Then M − 4 = 5 ( L − 4 ) M - 4 = 5(L - 4) M − 4 = 5 ( L − 4 ) so M = 5 L − 16 M = 5L - 16 M = 5 L − 16 , and M + 6 = 3 ( L + 6 ) M + 6 = 3(L + 6) M + 6 = 3 ( L + 6 ) so M = 3 L + 12 M = 3L + 12 M = 3 L + 12 . Equating, 5 L − 16 = 3 L + 12 5L - 16 = 3L + 12 5 L − 16 = 3 L + 12 , hence 2 L = 28 2L = 28 2 L = 28 and L = 14 L = 14 L = 14 , M = 54 M = 54 M = 54 . Check: four years ago the ages were 50 50 50 and 10 10 10 ; in six years they will be 60 60 60 and 20 20 20 .
Worked Example: Greatest Possible Largest Integer
Five distinct positive integers have mean 40 40 40 and median 35 35 35 . The sum is 200 200 200 . In order x 1 < x 2 < x 3 < x 4 < x 5 x_1 < x_2 < x_3 < x_4 < x_5 x 1 < x 2 < x 3 < x 4 < x 5 with x 3 = 35 x_3 = 35 x 3 = 35 , minimize 1 + 2 + 35 + 36 = 74 1 + 2 + 35 + 36 = 74 1 + 2 + 35 + 36 = 74 to maximize x 5 = 200 − 74 = 126 x_5 = 200 - 74 = 126 x 5 = 200 − 74 = 126 .
Worked Example: Guarantee Count
A box holds 12 12 12 red, 15 15 15 green, 18 18 18 blue, and 20 20 20 yellow balls. To guarantee at least 10 10 10 balls of one color, draw 9 9 9 of each color first ( 36 36 36 balls, still no color at 10 10 10 ), then one more ball — 37 37 37 draws.