Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2011 IMO Problems/Problem 3"

m
 
(3 intermediate revisions by 3 users not shown)
Line 2: Line 2:
  
 
==Solution==
 
==Solution==
−
{{solution}}
+
Let <math>P(x,y)</math> be the given assertion.
 +
Comparing <math>P(x,f(y)-x)</math> and <math>P(y,f(x)-y)</math> yields, <cmath>xf(x)+yf(y)\leq 2f(x)f(y).</cmath>
 +
<math>y\mapsto 2f(x)\implies xf(x)\leq 0. \qquad (*)</math>
 +
------------------------
 +
<math>\textbf{Claim: }f(k)\leq 0~~\forall k.</math>
 +
 
 +
<math>Proof.</math> Suppose <math>\exists k:f(k)>0,</math> then <cmath>f(k+y)\leq yf(k)+f(f(k)).</cmath>
 +
Now <math>y\to -\infty</math> implies that <math>\lim_{x\to -\infty} f(x)=-\infty.</math>
 +
<math>P(x,z-x)\implies f(z)\leq (z-x)f(x)+f(f(x)).</math>
 +
 
 +
Then <math>x\to -\infty,</math> yields a contradiction. <math>\blacksquare</math>
 +
--------------------------
 +
From <math>(*)</math> we get <math>f(x)=0,\forall x<0.</math>
 +
<math>P(0,f(0))\implies f(0)\geq 0,</math> thus we get <math>f(0)=0,</math> as desired. <math>\square</math>
 +
 
 +
                            ~ZETA_in_olympiad
 +
 
 +
==See Also==
 +
 
 +
{{IMO box|year=2011|num-b=2|num-a=4}}
 +
 
 +
[[Category:Olympiad Algebra Problems]]
 +
[[Category:Functional Equation Problems]]

Latest revision as of 01:20, 19 November 2023

Let $f: \mathbb R \to \mathbb R$ be a real-valued function defined on the set of real numbers that satisfies \[f(x + y) \le yf(x) + f(f(x))\] for all real numbers $x$ and $y$. Prove that $f(x) = 0$ for all $x \le 0$.

Solution

Let $P(x,y)$ be the given assertion. Comparing $P(x,f(y)-x)$ and $P(y,f(x)-y)$ yields, \[xf(x)+yf(y)\leq 2f(x)f(y).\] $y\mapsto 2f(x)\implies xf(x)\leq 0. \qquad (*)$

$\textbf{Claim: }f(k)\leq 0~~\forall k.$

$Proof.$ Suppose $\exists k:f(k)>0,$ then \[f(k+y)\leq yf(k)+f(f(k)).\] Now $y\to -\infty$ implies that $\lim_{x\to -\infty} f(x)=-\infty.$ $P(x,z-x)\implies f(z)\leq (z-x)f(x)+f(f(x)).$

Then $x\to -\infty,$ yields a contradiction. $\blacksquare$

From $(*)$ we get $f(x)=0,\forall x<0.$ $P(0,f(0))\implies f(0)\geq 0,$ thus we get $f(0)=0,$ as desired. $\square$ 

                           ~ZETA_in_olympiad

See Also

2011 IMO (Problems) • Resources
Preceded by
Problem 2 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Problem 4
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2011_IMO_Problems/Problem_3&oldid=204546"