How do you prove the inequality (a^3+b^3)(a^2-ab+b^2) <= a^5+b^5?

  • Thread starter Thread starter siddharthmishra19
  • Start date Start date
  • Tags Tags
    Inequality Proof
Click For Summary

Homework Help Overview

The problem involves proving the inequality \((a^3+b^3)(a^2-ab+b^2) \leq a^5+b^5\) for positive values of \(a\) and \(b\). The original poster expresses uncertainty about how to begin and seeks a straightforward method.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore various approaches, including trigonometric methods and creative long division. Some question the implications of the equality condition and consider the behavior of functions defined by \(f(n) = a^n + b^n\). Others suggest examining specific cases based on the values of \(a\) and \(b\).

Discussion Status

The discussion is ongoing, with participants sharing different lines of reasoning and approaches. Some have provided partial insights or transformations of the original inequality, while others encourage further exploration without reaching a definitive conclusion.

Contextual Notes

Participants note that the problem is constrained to positive values of \(a\) and \(b\) and discuss the implications of the equality condition in relation to the inequality being proven.

siddharthmishra19
Messages
27
Reaction score
0
The problem

For all a>0 and b>0 if a^3+b^3 = a^5+b^5 prove that
a^2+b^2<=1+ab

I have no idea on even how to start... i have tried using trigonometry (like in previous post) but come to a dead end... i am looking for the simplest method...
 
Physics news on Phys.org
The only proof I've been able to come up with is kind of weird. Maybe you can do better. You should easily be able to convince yourself that if both a and b are >1 the equality can't hold. Same for <1. So we can take a>=1 and b<=1. Now consider f(n)=a^n+b^n (n>0). Now show f(n) has one extermum and it's a minimum. Your premise says f(3)=f(5). This says the extremal n is between 3 and 5. So f(1)>=f(3). Or a+b>=a^3+b^3. Factor the LHS and divide by (a+b) and you have your result. Funny, huh?
 
I tried starting with a different approach. Since LHS = RHS, then RHS/LHS = 1. Doing a little creative long division, I obtained:

[tex]\frac{a^5+b^5}{a^3+b^3} = 1 = a^2 + b^2 - \frac{a^3 b^2 + a^2 b^3}{a^3 + b^3}[/tex]

From there,
[tex]1 + \frac{a^3 b^2 + a^2 b^3}{a^3 + b^3} = a^2 + b^2[/tex]

Then, perhaps on the LHS, factor out an ab:
[tex]1 + ab( \frac{a^2 b + a b^2}{a^3 + b^3}) = a^2 + b^2[/tex]

I'd think you can turn it around to [tex]a^2 + b^2 = 1 + ab( \frac{a^2 b + a b^2}{a^3 + b^3}) = (re-written) <= re-written with a term dropped out.[/tex]

I'm drawing a momentary blank (and have to get home!) but I can't "see" the next step from here; but maybe it's enough that you can continue.
 
Last edited:
Keep trying, drpizza. I'd love to see the non-calc proof. I tried stuff like that for quite a while.
 
It's equivalent to show that:

[tex](a^3 + b^3)(a^2 - ab + b^2) \leq a^5 + b^5[/tex]

This line is true iff:

[tex]a^5 + a^2b^3 - a^4b - ab^4 + a^3b^2 + b^5 \leq a^5 + b^5[/tex]

iff

[tex]a^2b^3 - a^4b - ab^4 + a^3b^2 \leq 0[/tex]

iff

[tex]ab^2 - a^3 - b^3 + a^2b \leq 0[/tex]

iff

[tex]a(b^2 - a^2) - b(b^2 - a^2) \leq 0[/tex]

iff

[tex](a-b)(b^2 - a^2) \leq 0[/tex]

iff

[tex](a-b)(b-a)(b+a) \leq 0[/tex]

iff

[tex]-(a-b)(a-b)(b+a) \leq 0[/tex]

iff

[tex](a-b)^2(b+a) \geq 0[/tex]

Well (a-b)2 is a square, hence non-negative. b and a are both positive, so (b+a) is positive. So the product on the left is indeed non-negative, so the desired result holds.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
Replies
6
Views
3K
Replies
7
Views
3K
Replies
3
Views
3K
Replies
4
Views
3K
  • · Replies 39 ·
2
Replies
39
Views
13K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K