All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic > Weights and Scales
Commemorations (Posted on 2013-02-06) Difficulty: 3 of 5
3 jealous brothers are to divvy up a set of commemorative coins.

There are an equal number of coins of each of the values: $1, $2, $3.

They discover that it is possible to do this in such a way that each brother gets a different assortment of coins, yet each gets the same number of coins and the same total value of coins.

What's the smallest possible number of coins in the set?

No Solution Yet Submitted by Jer    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Done. -spoiler | Comment 3 of 7 |
(In reply to Done. -spoiler by Ady TZIDON)

But

Brother 1 gets         A+A+A=1+1+1+3+3+3 

Brother 2 gets          A+A+B=1+1+2+2+3+3

Brother 3    gets       B+ B+B=2+2+2+2+2+2

has 5 1's, 5 3's and 6 2's, rather than an equal number of each denomination.

You want brother 3 to get A + B + B = 1 + 2 + 2 + 2 +2 + 3.

Edited on February 6, 2013, 5:09 pm
  Posted by Charlie on 2013-02-06 17:06:41

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information