Integer number is given. For every subset (not empty) of set we assing number in such a way: if numbers are all elements of set , therefore:

Count the sum of allnumbers

Printable View

- September 19th 2007, 01:27 PMUnunuquantiumVery interesting problem
Integer number is given. For every subset (not empty) of set we assing number in such a way: if numbers are all elements of set , therefore:

**Count the sum of all****numbers** - September 19th 2007, 06:07 PMThePerfectHacker
I solved this problem some time ago I forgot what I did. But anyway, you can look up the official solution because this was an AIME 1983 problem.

- September 19th 2007, 06:29 PMPlato
- September 19th 2007, 06:35 PMThePerfectHacker
- September 20th 2007, 12:07 AMUnunuquantium
Sorry, but i cannot find the solution, can anybody place it here, please?

- September 20th 2007, 09:14 AMUnunuquantium
Ok, I found the solution, thank you very much for the information