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

Home > Just Math
Not all are equal (Posted on 2011-12-03) Difficulty: 3 of 5
Given n distinct positive numbers a1,a2,...,an.
We construct all the possible sums (from 1 to n terms).

Prove that among those 2^n-1 sums there are at least n(n+1)/2 different ones.

Source: a problem from Soviet Union 1963 contest

No Solution Yet Submitted by Ady TZIDON    
Rating: 5.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Solution | Comment 6 of 8 |
(In reply to Solution by John Dounis)

I now follow.

The distinct sets are (in the case e.g. of numbers a to g):

a b c d e f g, then:
g+a                    g+b                g+c         g+d       g+e     g+f 
g+f+a                 g+f+b             g+f+c      g+f+d    g+f+e  
g+f+e+a             g+f+e+b         g+f+e+c  g+f+e+d   
g+f+e+d+a         g+f+e+d+b     g+f+e+d+c    
g+f+e+d+c+a     g+f+e+d+c+b     

Very  nice!

Edited on December 8, 2011, 7:02 am
  Posted by broll on 2011-12-08 02:13:23

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information