Difference between revisions of "1993 USAMO Problems/Problem 3"
(→Solution) |
(→Problem 3) |
||
Line 14: | Line 14: | ||
for every function <math>f</math> satisfying (i)-(iii) and every <math>x</math> in <math>[0, 1]</math>. | for every function <math>f</math> satisfying (i)-(iii) and every <math>x</math> in <math>[0, 1]</math>. | ||
− | |||
− | |||
== Solution== | == Solution== |
Revision as of 20:56, 22 February 2012
Problem 3
Consider functions which satisfy
(i) | ![]() ![]() ![]() | |
(ii) | ![]() | |
(iii) | ![]() ![]() ![]() ![]() ![]() |
Find, with proof, the smallest constant such that

for every function satisfying (i)-(iii) and every
in
.
Solution
My claim:
Lemma 1) for
For ,
(ii)
Assume that it is true for , then
By principle of induction, lemma 1 is proven.
Lemma 2) For any ,
and
,
.
(lemma 1 and (iii) )
(because
(i) )
,
. Thus,
works.
Let's look at a function $g(x)=\left\{
It clearly have property (i) and (ii). For and WLOG let
,
For ,
. Thus, property (iii) holds too. Thus
is one of the legit function.
but approach to
when
is extremly close to
from the right side.
Resources
1993 USAMO (Problems • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |