MHB How to prove an inequality with a direct proof?

AI Thread Summary
To prove the inequality $$a^{n} - b^{n} \le na^{n-1}(a-b)$$ for real numbers a and b where $$0 < b < a$$ and n is a positive integer, start by factorizing the left side as $$(a-b)(a^{n-1} + \ldots + b^{n-1})$$. The next step involves estimating the size of the second factor, which consists of n terms, each less than or equal to a. This leads to the conclusion that the sum is less than or equal to na, allowing the inequality to hold. The approach provides a clear pathway to completing the proof directly.
Moodion
Messages
2
Reaction score
0
Hello, I'm having trouble with an assigned problem, not really sure where to begin with it:

Prove that if $$a \in R$$ and $$b \in R$$ such that $$0 < b < a$$, then $${a}^{n} - {b}^{n} \le {na}^{n-1}(a-b)$$, where n is a positive integer, using a direct proof.

Pointers or the whole proof would be appreciated (might require some explanation afterwards!)

Thanks
 
Physics news on Phys.org
Moodion said:
Hello, I'm having trouble with an assigned problem, not really sure where to begin with it:

Prove that if $$a \in R$$ and $$b \in R$$ such that $$0 < b < a$$, then $${a}^{n} - {b}^{n} \le {na}^{n-1}(a-b)$$, where n is a positive integer, using a direct proof.

Pointers or the whole proof would be appreciated (might require some explanation afterwards!)

Thanks
Hi Moodion and welcome to MHB!

Try factorising $a^n-b^n$ as $(a-b)(a^{n-1} + \ldots + b^{n-1})$ and then estimate the size of the second factor.
 
Thanks for the hint, just what I needed
 

Similar threads

Replies
35
Views
4K
Replies
6
Views
2K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
4
Views
2K
Replies
1
Views
1K
Back
Top