GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 18 Feb 2019, 07:11

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

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

Events & Promotions

Events & Promotions in February
PrevNext
SuMoTuWeThFrSa
272829303112
3456789
10111213141516
17181920212223
242526272812
Open Detailed Calendar
• Valentine's day SALE is on! 25% off.

February 18, 2019

February 18, 2019

10:00 PM PST

11:00 PM PST

We don’t care what your relationship status this year - we love you just the way you are. AND we want you to crush the GMAT!
• Get FREE Daily Quiz for 2 months

February 18, 2019

February 18, 2019

10:00 PM PST

11:00 PM PST

Buy "All-In-One Standard (\$149)", get free Daily quiz (2 mon). Coupon code : SPECIAL

Coins are to be put into 7 pockets so that each pocket contains at lea

Author Message
TAGS:

Hide Tags

Senior Manager
Joined: 03 Mar 2010
Posts: 372
Schools: Simon '16 (M\$)
Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

29 Mar 2011, 10:52
1
1
2
00:00

Difficulty:

25% (medium)

Question Stats:

78% (01:42) correct 22% (01:53) wrong based on 445 sessions

HideShow timer Statistics

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?

(A) 7
(B) 13
(C) 17
(D) 22
(E) 28

_________________

My dad once said to me: Son, nothing succeeds like success.

Math Expert
Joined: 02 Sep 2009
Posts: 52935
Re: Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

04 Mar 2012, 17:48
eybrj2 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?

A. 7
B. 13
C. 17
D. 22
E. 28

Since at most 3 of the pockets are to contain the same number of coins then minimize # of coins in each, so let each contain just 1 coin;

Next, we are told that no two of the remaining 4 pockets should contain an equal number of coins, so they should contain 2, 3, 4, and 5 coins each (also minimum possible);

Total: 1+1+1+2+3+4+5=17.

_________________
General Discussion
Retired Moderator
Joined: 02 Sep 2010
Posts: 763
Location: London
Re: Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

29 Mar 2011, 12:59
Problems like these can be solved by the greedy approach

We start filling the pockets one by one all the time keeping the constraints in mind and see whats the least number of balls we can get away with.

Pocket 1 - Use 1 ball
Pocket 2 - Can still use just 1 ball
Pocket 3 - Can still use just 1 ball
Pocket 4 - Now we need a different number, and the least we can pick is 2
Pocket 5 - Similar to above, min we need to use is 3
Pocket 6 - Again, min we can use is 4
Pocket 7 - Finally min is 5

So net number is 1+1+1+2+3+4+5 = 17
_________________
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8883
Location: Pune, India
Re: Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

29 Mar 2011, 17:22
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?

(A) 7 (B) 13 (C) 17 (D) 22 (E) 28

Hit and Trial and Step by step analysis are two different things. My guess is that if you arrived at the correct answer, it was by step by step analysis.
It can be done in many ways. The following is how I would do it:

We need to minimize the number of coins needed.
Each pocket contains at least one coin so give one coin to each pocket - 7 coins used.
At most 3 pockets can have the same number of coins so let three pockets retain just one coin each (to minimize the number of coins) ...
Now we are left with 4 pockets - no two of these should have same number of coins so they should have 2, 3, 4 and 5 coins (to minimize the total number of coins)

Hence, minimum number of coins needed = 1+1+1+2+3+4+5 = 17
_________________

Karishma
Veritas Prep GMAT Instructor

Math Expert
Joined: 02 Sep 2009
Posts: 52935
Re: Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

14 Jun 2013, 04:26
1
Bumping for review and further discussion*. Get a kudos point for an alternative solution!

*New project from GMAT Club!!! Check HERE

All DS Min/Max Problems to practice: search.php?search_id=tag&tag_id=42
All PS Min/Max Problems to practice: search.php?search_id=tag&tag_id=63

_________________
Non-Human User
Joined: 09 Sep 2013
Posts: 9838
Re: Coins are to be put into 7 pockets so that each pocket contains at lea  [#permalink]

Show Tags

01 Oct 2018, 00:24
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: Coins are to be put into 7 pockets so that each pocket contains at lea   [#permalink] 01 Oct 2018, 00:24
Display posts from previous: Sort by