perplexus.info :: Weights and Scales : Commemorations

Commemorations (Posted on 2013-02-06)

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(2): Done. -spoiler

| Comment 5 of 7 |

(In reply to re: Done. -spoiler by Charlie)

THANKS, Charlie

corrected a typo b+b+b ==> a+b+b

NOW OK,

Posted by Ady TZIDON on 2013-02-06 20:45:10

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 (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info