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?
(In reply to
re: A misread? by Jer)
Charlie posted:
per
den total $1 $2 $3 $1 $2 $3 $1 $2 $3
6 18 1 4 1 2 2 2 3 0 3
..............
9 27 2 5 2 3 3 3 4 1 4
With a small edit this is mine:
9 (27) (2 5 2) (3 3 3) (4 1 4) $18
I did not have the total coins (27) or the value of each
share ($18) in my previous post.
Edited on February 7, 2013, 12:09 am
|
|
Posted by brianjn
on 2013-02-07 00:08:13 |
re(2): A misread?
