MHB How to prove an inequality with a direct proof?

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
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

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