Last visit was: 26 Apr 2026, 19:32 It is currently 26 Apr 2026, 19:32
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 26 Apr 2026
Posts: 109,910
Own Kudos:
811,446
 [3]
Given Kudos: 105,897
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,910
Kudos: 811,446
 [3]
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 24 Apr 2026
Posts: 4,143
Own Kudos:
11,280
 [1]
Given Kudos: 99
Expert
Expert reply
Posts: 4,143
Kudos: 11,280
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
luisdicampo
Joined: 10 Feb 2025
Last visit: 19 Apr 2026
Posts: 480
Own Kudos:
Given Kudos: 328
Products:
Posts: 480
Kudos: 75
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Edskore
Joined: 29 Dec 2022
Last visit: 26 Apr 2026
Posts: 296
Own Kudos:
Given Kudos: 5
Posts: 296
Kudos: 131
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
Moderators:
Math Expert
109910 posts
Tuck School Moderator
852 posts