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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Three piles of 7 beans each are to be made from 10 red, 5 yellow, and 6 green beans. If all of the beans must be used and each stack must contain at least one bean of each color, then what is the maximum number of red beans that can be put in one of the stacks? A.5 B.6 C.8 D.9 E.10

Since each pile must have a bean of each color, max red beans can be 5 in any pile. Rest of the options automatically eliminates themselves because if max red beans is to be 6, 2 more (yellow and green) makes it 8 in each pile...not possible.

yep it's that easy - deceptively so... however it wasn't easy to think of the solution under test conditions! I thought it may have been a combinatorics problem initially.