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

Home > Numbers > Sequences
Commemorations 2 (Posted on 2013-02-11) Difficulty: 3 of 5
3 jealous brothers are to divvy up a set of commemorative coins.

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

For each of the numbers n = 1 to 8
determine in how many ways it is possible to divide the set of coins in such a way that each brother gets the same number of coins and the same total value of coins.

Do not count permutations of the brothers separately. Just count the breakdowns.

Note 1: Please avoid the temptation to look this sequence up. It will give away a surprise.
Note 2: I would prefer you not do this with a computer program.

No Solution Yet Submitted by Jer    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionI can't solve this without a computer (spoiler)Charlie2013-02-11 18:54:33
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 (3)
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