Home > Just Math
Not all are equal (Posted on 20111203) 

Given n distinct positive numbers a1,a2,...,an.
We construct all the possible sums (from 1 to n terms).
Prove that among those 2^n1 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: (
You must be logged in to post comments.)


Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ 
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
