BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

Three piles (A, B, C) of 7 beans each are to be made from 12

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
GMAT Instructor
Posts: 1449
Joined: Sat Oct 09, 2010 2:16 pmFollowed by: 33 members
Thanked: 59 times
by fskilnik@GMATH » Thu Oct 04, 2018 11:13 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty—

Three piles (A, B, C) of 7 beans each are to be made from 12 red, 5 yellow and 4 green beans. If each stack must contain at least one bean of each color and stack A must get the maximum number of red beans possible, what is the minimum number of red beans to be put in stack B?

(A) 1
(B) 2
(C) 3
(D) 4
(E) 5

Answer: [spoiler]__(B)____ [/spoiler]
Difficulty Level: 600 - 650
Source: https://www.GMATH.net
(Exercise 9 of the Quant Class #03 included in our free test drive!)
Fabio Skilnik :: GMATH method creator ( Math for the GMAT)
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Senior | Next Rank: 100 Posts
Posts: 46
Joined: Sun Dec 27, 2015 7:03 amFollowed by: 1 member
Thanked: 8 times

by chetan.sharma » Fri Oct 05, 2018 4:58 am
fskilnik@GMATH wrote:Three piles (A, B, C) of 7 beans each are to be made from 12 red, 5 yellow and 4 green beans. If each stack must contain at least one bean of each color and stack A must get the maximum number of red beans possible, what is the minimum number of red beans to be put in stack B?

(A) 1
(B) 2
(C) 3
(D) 4
(E) 5

Answer: [spoiler]__(B)____ [/spoiler]
Piles - A,B,C
Since we are looking for least red in B, let us distribution max red in other two..
1) A has to get max possible..
As one each is a must remaining 5 can be red
2) similarly for C too

So total 5+5 red gone,
Remaining 12-10=2 have to go to B

Ans B
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
GMAT Instructor
Posts: 1449
Joined: Sat Oct 09, 2010 2:16 pmFollowed by: 33 members
Thanked: 59 times

by fskilnik@GMATH » Fri Oct 05, 2018 7:14 am
fskilnik@GMATH wrote:Three piles (A, B, C) of 7 beans each are to be made from 12 red, 5 yellow and 4 green beans. If each stack must contain at least one bean of each color and stack A must get the maximum number of red beans possible, what is the minimum number of red beans to be put in stack B?

(A) 1
(B) 2
(C) 3
(D) 4
(E) 5

Source: https://www.GMATH.net
(Exercise 9 of the Quant Class #03 included in our free test drive!)
Thank you for your contribution, chetan.sharma !

My "official solution" (the one presented in GMATH´s course) is the following:
$$?\,\, = \,\,{\left( {{\rm{\# }}\,\,{\rm{red}}\,\,{\rm{in}}\,\,{\rm{B}}} \right)_{\,\,{\rm{MIN}}}}$$
Let´s focus on stack A at first. It must contain 7 beans, and 3 of them must be of different colors, exactly one (of these 3 beans) red.

Now we must choose the other 4 beans of pile A and, in order to maximize the number of red beans (why?) , we will take all 4 of them red.
(Conclusion: stack A will contain 5 red beans.)

It´s time to focus on pile C, because we are also interested in maximizing its number of red beans...
Repeating the same reasoning above, from the 12-5 = 7 red beans left, we will (again) take 5 of them to be put on this stack (C),
remaining (the minimum of) 2 red beans to be chosen for the remainder pile (B)!

Important: all 21 beans must be allocated, otherwise we would not have 3 piles with 7 beans in each one of them!


This solution follows the notations and rationale taught in the GMATH method.

Regards,
Fabio.
Fabio Skilnik :: GMATH method creator ( Math for the GMAT)
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1