Fatskills
Practice. Master. Repeat.
Study Guide: How to Solve: Mean, Median, Mode (GRE/GMAT) – Complete Guide
Source: https://www.fatskills.com/gre/chapter/how-to-solve-mean-median-mode-gregmat-complete-guide

How to Solve: Mean, Median, Mode (GRE/GMAT) – Complete Guide

By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.

⏱️ ~7 min read

How to Solve: Mean, Median, Mode (GRE/GMAT) – Complete Guide

Score Impact: This question type appears 4-6 times per GRE/GMAT—mastering it can boost your Quant score by 3-5 points (enough to move from the 70th to the 90th percentile).


WHAT THIS QUESTION TYPE IS ACTUALLY TESTING

The exam isn’t testing your ability to calculate mean, median, or mode—it’s testing: 1. Precision under pressure – Can you avoid misreading the question (e.g., confusing "median" with "mean")? 2. Logical reasoning – Can you deduce missing values from given conditions (e.g., "the median is 10, what must be true?")? 3. Data sufficiency – Can you determine if a statement is enough to answer the question (GMAT-specific)?


ANATOMY OF THE QUESTION

Structure Breakdown

  1. Stem – Describes a dataset (e.g., "A set of 5 numbers has a mean of 12").
  2. Conditions – Additional constraints (e.g., "the median is 10, and the mode is 8").
  3. Answer Choices – Typically 5 options (GMAT) or 4-5 (GRE), often testing:
  4. Missing values
  5. Relationships between mean/median/mode
  6. Sufficiency of given data
  7. What to Ignore – Irrelevant details (e.g., "the numbers are positive integers" unless it affects calculations).

Representative Example (GMAT-Style)

Set S contains 7 distinct integers. The mean of S is 20, the median is 21, and the mode is 22. What is the smallest possible value in S? (A) 1 (B) 2 (C) 3 (D) 4 (E) 5


THE DECISION FRAMEWORK (Step-by-Step)

Run this process every time—no exceptions.

  1. Read the stem carefully.
  2. Underline: mean, median, mode, and any constraints (e.g., "distinct integers").
  3. Note the number of elements (e.g., "7 numbers").

  4. Write down definitions.

  5. Mean = Sum / Count → Sum = Mean × Count
  6. Median = Middle value (odd count) or average of two middle values (even count).
  7. Mode = Most frequent value (can be multiple modes).

  8. List knowns and unknowns.

  9. Example: For the problem above:

    • Known: 7 numbers, mean = 20 → sum = 140.
    • Median = 21 → 4th number = 21.
    • Mode = 22 → 22 appears at least twice.
  10. Construct the dataset skeleton.

  11. For odd counts: _ _ _ [Median] _ _ _
  12. For even counts: _ _ [Median1] [Median2] _ _
  13. Example: _ _ _ 21 _ _ _

  14. Apply constraints to fill in values.

  15. Mode = 22 → At least two 22s. Place them to the right of the median (to keep the median at 21).
  16. Example: _ _ _ 21 22 22 _
  17. Sum = 140 → Remaining sum = 140 - (21 + 22 + 22) = 75.
  18. Fill left side with smallest possible distinct integers (to minimize the smallest value).

  19. Test answer choices.

  20. Start with the smallest option (A) and work upward.
  21. Example: If smallest = 1 → 1, 2, 3, 21, 22, 22, x → x = 140 - (1+2+3+21+22+22) = 69 → Valid.
  22. But check if mode is still 22 (yes, since 22 appears twice and others once).

  23. Eliminate wrong answers.

  24. If smallest = 1 works, eliminate B-E.

Worked Examples

Example 1 – Straightforward (GRE-Style)

Set T has 5 numbers. The mean is 10, the median is 12, and the mode is 12. What is the largest possible value in T? (A) 12 (B) 14 (C) 16 (D) 18 (E) 20

Step-by-Step: 1. Stem: 5 numbers, mean = 10 → sum = 50. 2. Median: 3rd number = 12. 3. Mode: 12 appears at least twice. 4. Skeleton: _ _ 12 _ _ 5. Constraints:
- At least two 12s → 12 appears twice (to maximize largest value).
- Example: x, 12, 12, 12, y (but mode is only 12, so 12 must appear more than others).
- Better: x, y, 12, 12, z (sum = x + y + 12 + 12 + z = 50). 6. Maximize z:
- Minimize x and y (must be ≤ 12 to keep median at 12).
- Let x = y = 1 → 1 + 1 + 12 + 12 + z = 50 → z = 24 (but mode is 12, so 12 must appear more than others → invalid).
- Let x = 1, y = 11 → 1 + 11 + 12 + 12 + z = 50 → z = 14.
- Check mode: 12 appears twice, others once → valid. 7. Answer: (B) 14.


Example 2 – Common Trap (GMAT-Style)

Set Q has 6 numbers. The mean is 8, the median is 7, and the mode is 6. Which of the following could be the largest number in Q? (A) 10 (B) 12 (C) 14 (D) 16 (E) 18

Trap: Students assume the mode appears twice and forget it could appear more.

Step-by-Step: 1. Stem: 6 numbers, mean = 8 → sum = 48. 2. Median: Average of 3rd and 4th numbers = 7 → 3rd + 4th = 14. 3. Mode: 6 appears at least twice (could appear 3+ times). 4. Skeleton: _ _ [3rd] [4th] _ _ 5. Constraints:
- Let 3rd = 6, 4th = 8 (sum = 14).
- Mode = 6 → 6 appears at least twice. Let 1st and 2nd = 6.
- Skeleton: 6, 6, 6, 8, x, y (sum = 6+6+6+8+x+y = 48 → x+y = 22). 6. Maximize y:
- Let x = 6 → y = 16 (but mode is 6, so 6 appears 4 times → valid).
- Check median: 3rd = 6, 4th = 8 → median = 7 → valid. 7. Answer: (D) 16.


Example 3 – Hard Variant (Top Scoring Band)

Set R has 5 distinct positive integers. The mean is 15, the median is 15, and the mode is 15. What is the smallest possible value in R? (A) 1 (B) 2 (C) 3 (D) 4 (E) 5

Step-by-Step: 1. Stem: 5 distinct integers, mean = 15 → sum = 75. 2. Median: 3rd number = 15. 3. Mode: 15 appears at least twice (but distinct → can’t repeat).
- Trap: Mode is 15, but distinct integers → 15 can appear only once. Contradiction?
- Solution: Mode is the most frequent. If all numbers are distinct, no mode exists. But the question says "the mode is 15," so 15 must appear more than others → impossible with distinct integers.
- Re-evaluate: The question must allow non-distinct mode. Assume "distinct" applies to other numbers. 4. Skeleton: _ _ 15 15 _ 5. Constraints:
- Sum = 75 → x + y + 15 + 15 + z = 75 → x + y + z = 45.
- Distinct: x, y, z ≠ 15 and x < y < 15 < 15 < z. 6. Minimize x:
- Let x = 1, y = 2 → 1 + 2 + z = 45 → z = 42.
- Check distinct: 1, 2, 15, 15, 42 → valid. 7. Answer: (A) 1.


WRONG ANSWER PATTERNS

  1. Mean/Median Confusion
  2. Why it looks right: Students calculate the mean when the question asks for the median.
  3. Why it’s wrong: The mean and median are rarely the same in skewed datasets.

  4. Ignoring "Distinct" or "Positive" Constraints

  5. Why it looks right: Students assume numbers can repeat or be negative.
  6. Why it’s wrong: The question specifies constraints (e.g., "distinct positive integers").

  7. Assuming Mode Appears Exactly Twice

  8. Why it looks right: Students default to two occurrences of the mode.
  9. Why it’s wrong: The mode can appear more than twice (e.g., three 6s in a set).

  10. Incorrect Median Placement

  11. Why it looks right: Students miscount the median position (e.g., 4th number in a 5-number set).
  12. Why it’s wrong: For odd counts, the median is the (n+1)/2th number.

Common Mistakes

  1. Mistake: Forgetting to sort the dataset.
  2. Why it happens: Students rush and calculate median without ordering.
  3. Correct approach: Always sort numbers before finding median/mode.

  4. Mistake: Misapplying the mode definition.

  5. Why it happens: Students assume the mode is the highest frequency, even if all numbers appear once.
  6. Correct approach: If all numbers are distinct, there is no mode.

  7. Mistake: Not checking answer choices against all constraints.

  8. Why it happens: Students pick the first plausible answer.
  9. Correct approach: Verify the answer satisfies mean, median, mode, and other conditions.

  10. Mistake: Overcomplicating the dataset.

  11. Why it happens: Students add unnecessary variables.
  12. Correct approach: Use the minimum number of variables needed (e.g., for 5 numbers, use 3 variables if median is fixed).

  13. Mistake: Ignoring "could be" vs. "must be" language.

  14. Why it happens: Students assume the question asks for a definitive answer.
  15. Correct approach: For "could be" questions, find one valid example. For "must be," ensure all cases satisfy the condition.

TIME STRATEGY

  • Target time: 1.5–2 minutes per question.
  • When to skip: If you can’t construct the dataset within 1 minute, flag and return.
  • Minimum work:
  • Calculate sum from mean.
  • Place median in the correct position.
  • Apply mode constraints.
  • Test answer choices from smallest/largest.

BACKSOLVING AND SHORTCUTS

  1. Plug in answer choices:
  2. Start with the middle option (C) and adjust based on whether it’s too high/low.

  3. Use symmetry:

  4. For even counts, the median is the average of two middle numbers → their sum is fixed.

  5. Eliminate extremes:

  6. If the question asks for the smallest possible value, eliminate options that are too large (e.g., if sum is 100 and median is 20, smallest value can’t be 50).

  7. Leverage mode frequency:

  8. If the mode appears k times, ensure no other number appears more than k-1 times.

1-Minute Recap

"Here’s your 30-second cheat sheet for mean-median-mode questions: 1. Mean → Sum = Mean × Count. Write this down first. 2. Median → Sort the numbers, find the middle. For even counts, average the two middle numbers. 3. Mode → Most frequent number. If all are distinct, no mode exists. 4. Constraints → Underline ‘distinct,’ ‘positive,’ or ‘integers’—these change everything. 5. Test answers → Start with the smallest or largest option and work backward.

Remember: The exam is testing your precision, not your speed. Slow down, write down the skeleton, and fill in the blanks. You’ve got this!


Final Tip: Practice with official GRE/GMAT questions only—third-party questions often oversimplify the traps. Use this framework on every problem, and you’ll see the patterns.



ADVERTISEMENT