Good problem — this is a disguised Remainders + LCM question, which is exactly the kind that trips students up because the wording buries the actual math structure.
Key concept being tested: Remainders and LCM
The common trap is treating "5 or 6 dozen per box" as two separate scenarios to test individually, rather than recognizing that the remainder condition applies to both simultaneously.
Step 1: Translate the problem into remainder language.
Let N = total dozens of oranges.
- When packed in boxes of 5 dozen: 3 dozen remain → N ≡ 3 (mod 5)
- When packed in boxes of 6 dozen: 3 dozen remain → N ≡ 3 (mod 6)
- When packed in boxes of 8 dozen: 3 dozen remain → N ≡ 3 (mod 8)
- When packed in boxes of 9 dozen: 3 dozen remain → N ≡ 3 (mod 9)
Step 2: Recognize the pattern.
N − 3 is divisible by 5, 6, 8, and 9 simultaneously. So N − 3 = LCM(5, 6, 8, 9).
Step 3: Calculate the LCM.
5 = 5
6 = 2 × 3
8 = 23
9 = 32
LCM = 5 × 23 × 32 = 5 × 8 × 9 = 360
Step 4: Solve for N.
N − 3 = 360 → N = 363
Answer: D (363)
Why students get stuck: The problem mentions "bigger boxes of 8 or 9 dozen" later in the stem, which makes it feel like a two-part scenario. Once you see that every packing size leaves exactly 3 dozen behind, it collapses to a clean LCM problem. The structure is: if N ≡ r (mod a) and N ≡ r (mod b), find the smallest such N. Classic GMAT remainder pattern.
Takeaway: Any time every divisor leaves the same remainder, find LCM of the divisors and add the remainder — that's your answer.
---
Kavya | 725 GMAT Focus | Free gamified GMAT prep: edskore.com