# 2001 AIME II Problems/Problem 5

## 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}$.

## Note

If we wanted to find this for a much larger number (say 2001), we could have noted that this is actually a "quasi-Fibonacci" sequence with initial terms $4,5$ and built up an explicit function to find the $nth$ term. (The latter part is generally pretty annoying).

~Dhillonr25

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.
{"ft_lang_label":"__label__en","ft_lang_prob":0.87627625,"math_prob":0.99773675,"size":1594,"snap":"2023-40-2023-50","text_gpt3_token_len":371,"char_repetition_ratio":0.14088051,"word_repetition_ratio":0.021505376,"special_character_ratio":0.23839398,"punctuation_ratio":0.072916664,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9995221,"pos_list":[0,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,26,27,28,29,30,31,32,33,34],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,3,null,9,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-10T00:45:30Z\",\"WARC-Record-ID\":\"<urn:uuid:8a7b1b89-b9d0-4e05-bb08-ffec664326d7>\",\"Content-Length\":\"42248\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9d0b8035-49a2-47fb-93ad-584097713ac3>\",\"WARC-Concurrent-To\":\"<urn:uuid:7933a9c3-6db0-423b-80dd-d322f4be80d7>\",\"WARC-IP-Address\":\"104.26.10.229\",\"WARC-Target-URI\":\"https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_5\",\"WARC-Payload-Digest\":\"sha1:47V5UEQACRULNPKY6EABCPQNEO6XMYU3\",\"WARC-Block-Digest\":\"sha1:BIZA6KAW4Y2HSRJHM3JPOWPWCPNK5X6X\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100989.75_warc_CC-MAIN-20231209233632-20231210023632-00221.warc.gz\"}"}