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.)
possible solution | Comment 1 of 8
The reference to 2^n-1 sums seems unnecessary. There are n numbers from 1 to n so the largest number that can be obtained is clearly the nth triangular number; indeed this is true by definition. And since we are combining the numbers in all possible ways, it must equally be possible to obtain each of the n(n+1)/2 sums.

Edited on December 4, 2011, 4:18 am
  Posted by broll on 2011-12-04 04:09:59

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 (10)
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