Difference between revisions of "1986 AIME Problems/Problem 12"
m (box) |
m |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | Let the sum of a set of numbers be the sum of its elements. Let <math>\displaystyle S</math> be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of <math>\displaystyle S</math> have the same sum. What is the largest sum a set <math>\displaystyle S</math> with these properties can have? | |
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== See also == | == See also == | ||
* [[1986 AIME Problems]] | * [[1986 AIME Problems]] | ||
{{AIME box|year=1986|num-b=11|num-a=13}} | {{AIME box|year=1986|num-b=11|num-a=13}} | ||
Revision as of 20:26, 10 February 2007
Problem
Let the sum of a set of numbers be the sum of its elements. Let 
be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of have the same sum. What is the largest sum a set with these properties can have?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1986 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
