Community

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.
Login Register Memberlist Search AoPS Blogs Contests Galleries Forum Index
The time now is Thu Dec 03, 2009 8:51 pm
All times are UTC - 8
View posts since last visit
View unanswered posts
inequality
Moderators: High School Basics Moderators
Post new topic   Reply to topic View previous topicView next topic
7 Posts • Page 1 of 1
Author Message
AndrewTom
Navier-Stokes Equations
Navier-Stokes Equations

Offline
Joined: 13 Dec 2006
Posts: 1641

To rate posts you must be logged in
#1
inequality

Prove that \frac{x+y}{1+x+y} < \frac{x}{1+x} + \frac{y}{1+y}, for all positive numbers x and y.

PostPosted: Mon Oct 26, 2009 4:01 am  Back to top 
  ProfilePM
darkdieuguerre
Riemann Hypothesis
Riemann Hypothesis

Offline
Joined: 09 Nov 2007
Posts: 349
Location: Maryland

To rate posts you must be logged in
#2
Proof
If a < c and b<d, then a+b<c+d.

1+x+y > 1+x, so \displaystyle\frac{x}{1+x+y} < \displaystyle\frac{x}{1+x}. Similarly, \displaystyle\frac{y}{1+x+y} < \displaystyle\frac{y}{1+y}. Therefore, \displaystyle\frac{x}{1+x+y} + \displaystyle\frac{y}{1+x+y} < \displaystyle\frac{x}{1+x} + \displaystyle\frac{y}{1+y}, which is the desired result.

_________________
10^{12} bites do not make a terrabyte.

PostPosted: Mon Oct 26, 2009 4:25 am  Back to top 
  ProfilePM
akashram
New Member
New Member

Offline
Joined: 12 Oct 2009
Posts: 11
Location: India-chennai
India

To rate posts you must be logged in
#3
Just use andrscu's lemma and you are done

PostPosted: Sat Oct 31, 2009 8:53 pm  Back to top 
  ProfilePM
randomguy64
Poincare Conjecture
Poincare Conjecture

Offline
Joined: 21 Aug 2009
Posts: 124
Location: California

To rate posts you must be logged in
#4
what's that?

PostPosted: Sat Oct 31, 2009 9:33 pm  Back to top 
  ProfilePM
AndrewTom
Navier-Stokes Equations
Navier-Stokes Equations

Offline
Joined: 13 Dec 2006
Posts: 1641

To rate posts you must be logged in
#5
Titu Andrescu's lemma is known as Titu's lemma. See here: http://www.artofproblemsolving.com/Forum/weblog_entry.php?t=264227

PostPosted: Sun Nov 01, 2009 4:47 am  Back to top 
  ProfilePM
varunrocks
Riemann Hypothesis
Riemann Hypothesis

Online
Joined: 25 Dec 2007
Posts: 292

To rate posts you must be logged in
#6
How do u use T2's Lemma if
you get that
(x/x+1)+(y/y+1)>=(x+y)^2/x+y+2
how does that help?

PostPosted: Sun Nov 01, 2009 9:56 am  Back to top 
  ProfilePM
Agr_94_Math
Yang-Mills Theory
Yang-Mills Theory

Offline
Joined: 17 Feb 2008
Posts: 714
India

To rate posts you must be logged in
#7

Akashram's solution

Akashram is right. But I don't know why people call it Titu's lemma or Engel Cauchy or whatever.
For example, using the Holder's Inequality if I say
\sum \frac{x_i^k}{a_i}\ge \frac{(\sum x_i)^k}{n^{k-2} \sum a_i}, will I say it as Agr_94_Math's lemma?

Anyway, as far as the solution is concerned,
writing the RHS as \sum \frac{x^2}{x+x^2} we get that \sum \frac{x^2}{x+x^2} \ge \frac{(x+y)^2}{x+y+x^2+y^2} BY CAUCHY SCHWARZ.
So we have to now prove that \frac{(x+y)^2}{x+y+x^2+y^2} \ge \frac{x+y}{1+x+y}.
Simplifying, it is equivalent to 2xy \ge 0 which is obviously true and equality and cannot hold as x,y >0.
Thus, we prove the inequality.

Akashram, since you are new, it is no problem but in future see to it that you post your solutions completely when you want to post, so that it avoids spamming.

PostPosted: Thu Nov 05, 2009 7:24 pm  Back to top 
  ProfilePMBlog
Display posts from previous:   Sort by:   
7 Posts • Page 1 of 1
Post new topic   Reply to topic View previous topicView next topic
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum


© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us