Problem #WSP-5073

Problems Discrete Mathematics Algorithm Theory

Problem

Scrooge McDuck has 100 golden coins on his office table. He wants to distribute them into 10 piles so that no two piles contain the same amount of coins. Moreover, no matter how you divide any of the piles into two smaller piles, among the resulting 11 piles there will be two with the same amount of coins. Find an example of how he could do that.