Need to understand the concept based solution

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 429
Joined: Wed Sep 19, 2012 11:38 pm
Thanked: 6 times
Followed by:4 members
Coins are to be put into 7 pockets so that each pocket contains at least one coin. At most 3 of the pockets are to contain the same number of coins, and no two of the remaining pockets are to contain an equal number of coins. What is the least possible number of coins needed for the pockets?
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Tue Jun 11, 2013 6:24 am
[email protected] wrote:Coins are to be put into 7 pockets so that each pocket contains at least one coin. At most 3 of the pockets are to contain the same number of coins, and no two of the remaining pockets are to contain an equal number of coins. What is the least possible number of coins needed for the pockets?
We want to minimize the number of coins. Since there must be at least 1 coin per pocket, let's put 1 coin in the first 3 pockets.
Pocket #1: 1 coin
Pocket #2: 1 coin
Pocket #3: 1 coin

No two of the remaining pockets are to contain an equal number of coins.
So, from this point on, we cannot put 1 coin in any more pockets (otherwise, we'll break the rule about no more than 3 pockets containing the same number of coins).
To minimize the number of coins, we'll put 2 coins in pocket #4, then 3 in pocket #5 and so on...
Pocket #4: 2 coins
Pocket #5: 3 coins
Pocket #6: 4 coins
Pocket #7: 5 coins

So, the minimum number of coins = 1+1+1+2+3+4+5 = 17

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image