Difference between revisions of "2012 USAMO Problems/Problem 1"
(→Solution) |
|||
Line 12: | Line 12: | ||
Now since we know that the Fibonacci set is the smallest possible set which does not satisfy the conditions of the problem, then any set <math>\{c\}</math> whose greatest term is less than <math>F_{n-1}</math> must satisfy the conditions. And since <math>\{c\}</math> is bounded between <math>1</math> and <math>n^2</math>, then the conditions of the problem are met if and only if <math>F_{n-1} > n^2</math>. The first <math>n</math> for which this restriction is satisfied is <math>n=13</math> and the exponential behavior of the Fibonacci numbers ensure that every <math>n</math> greater than <math>13</math> will also satisfy this restriction. So the final solution set is <math>\boxed{\{n \ge 13\}}</math>. | Now since we know that the Fibonacci set is the smallest possible set which does not satisfy the conditions of the problem, then any set <math>\{c\}</math> whose greatest term is less than <math>F_{n-1}</math> must satisfy the conditions. And since <math>\{c\}</math> is bounded between <math>1</math> and <math>n^2</math>, then the conditions of the problem are met if and only if <math>F_{n-1} > n^2</math>. The first <math>n</math> for which this restriction is satisfied is <math>n=13</math> and the exponential behavior of the Fibonacci numbers ensure that every <math>n</math> greater than <math>13</math> will also satisfy this restriction. So the final solution set is <math>\boxed{\{n \ge 13\}}</math>. | ||
+ | ==This is not graffiti== | ||
+ | Uh, <math>F_12</math>=144 and 13^2=169. Last I checked, 169>144 | ||
==See also== | ==See also== |
Revision as of 10:23, 28 April 2012
Problem
Find all integers such that among any positive real numbers , , , with there exist three that are the side lengths of an acute triangle.
Solution
Without loss of generality, assume that the set is ordered from least to greatest so that the bounding condition becomes Now set and since a triangle with sidelengths from will be similar to the corresponding triangle from we simply have to show the existence of acute triangles in Note that and for all ,
Now three arbitrary sidelengths , , and , with will form a valid triangle if and only if Furthermore, this triangle will be acute if and only if However, the first inequality can actually be inferred from the second, since and is trivially greater than So we just need to find all such that there is necessarily a triplet of 's for which (where ).
We now make another substitution: So and for all , Now we examine the smallest possible sets for small for which the conditions of the problem are not met. Note that by smallest, we mean the set whose greatest element is as small as possible. If , then the smallest possible set, call it is trivially , since and are obviously minimized and follows as minimal. Using this as the base case, we see inductively that in general is the set of the first Fibonacci numbers. To show this note that if , then The smallest possible value for is the sum of the two greatest values of which are and . But these sum to so and our induction is complete.
Now since we know that the Fibonacci set is the smallest possible set which does not satisfy the conditions of the problem, then any set whose greatest term is less than must satisfy the conditions. And since is bounded between and , then the conditions of the problem are met if and only if . The first for which this restriction is satisfied is and the exponential behavior of the Fibonacci numbers ensure that every greater than will also satisfy this restriction. So the final solution set is .
This is not graffiti
Uh, =144 and 13^2=169. Last I checked, 169>144
See also
2012 USAMO (Problems • Resources) | ||
First Problem | Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |