AoPSWiki
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

2001 AIME II Problems/Problem 5

From AoPSWiki

Problem

A set of positive numbers has the triangle property if it has three distinct elements that are the lengths of the sides of a triangle whose area is positive. Consider sets \{4, 5, 6, \ldots, n\} of consecutive positive integers, all of whose ten-element subsets have the triangle property. What is the largest possible value of n?

Solution

Out of all ten-element subsets with distinct elements that do not possess the triangle property, we want to find the one with the smallest maximum element. Call this subset \mathcal{S}. Without loss of generality, consider any a, b, c \,\in \mathcal{S} with a < b < c. \,\mathcal{S} does not possess the triangle property, so c \geq a + b. We use this property to build up \mathcal{S} from the smallest possible a and b:

\mathcal{S} = \{\, 4,\, 5,\, 4+5, \,5+(4+5),\, \ldots\,\} = \{4, 5, 9, 14, 23, 37, 60, 97, 157, 254\}

\mathcal{S} is the "smallest" ten-element subset without the triangle property, and since the set \{4, 5, 6, \ldots, 253\} is the largest set of consecutive integers that does not contain this subset, it is also the largest set of consecutive integers in which all ten-element subsets possess the triangle property. Thus, our answer is n = \fbox{253}.

See also

2001 AIME II (ProblemsResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us