2005 AMC 10B Problems/Problem 25
A subset of the set of integers from to , inclusive, has the property that no two elements of sum to . What is the maximum possible number of elements in ?
The question asks for the maximum possible number of elements. The integers from to can be included because you cannot make with integers from to without the other number being greater than . The integers from to are left. They can be paired so the sum is : , , , , . That is pairs, and at most one number from each pair can be included in the set. The total is . Also, it is possible to see that since the numbers to are in the set there are only the numbers to to consider. As gives , the numbers to can be put in subset without having two numbers add up to . In this way, subset will have the numbers to , and so .
Solution 2 (If you have no time)
"Cut" into half. The maximum integer value in the smaller half is . Thus the answer is .
The maximum possible number of elements includes the smallest numbers. So, subset where n is the maximum number of elements in subset . So, we have to find two consecutive numbers, and , whose sum is . Setting up our equation, we have . When we solve for , we get . Thus, the anser is .
lol this should have been like #13 or so
|2005 AMC 10B (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 10 Problems and Solutions|