Help with an arithmetic proof by induction

AI Thread Summary
The discussion focuses on proving the inequality $$\frac {b^{n + 1} - a^{n + 1}} {b - a} < (n + 1)b^n$$ for the case where ##0 \leq a < b## using mathematical induction. The basis case for ##n = 1## is established successfully, showing that the inequality holds. The inductive step presents challenges, particularly in transitioning from the assumption for ##n## to the case for ##n + 1##. A key insight shared is the equation $$b^{n+1} - a^{n+1} = (b-a)(b^n + ab^{n-1} + \dots + a^{n-1}b + a^n)$$ which simplifies the proof. Ultimately, the proof is confirmed to be valid under the conditions specified.
Entertainment Unit
Messages
16
Reaction score
1

Homework Statement


Show that if ##0 \leq a < b##, then
$$\frac {b^{n + 1} - a^{n + 1}} {b - a} < (n + 1)b^n$$

Homework Equations


None that I'm aware of.

The Attempt at a Solution


Proof (Induction)
1. Basis Case: Suppose ##n = 1##. It follows that:
$$\frac {b^{1 + 1} - a^{1 + 1}} {b - a} < (1 + 1)b^1$$
$$\frac {b^2 - a^2} {b - a} < 2b$$
$$b^2 - a^2< 2b(b - a)$$
$$b^2 - a^2< 2b^2- 2ab$$
$$-a^2< 2b^2$$

which is true for all ##0 \leq a < b##.

2. Inductive Step. Let ##k = n \geq 1## and suppose that:
$$\frac {b^{k + 1} - a^{k + 1}} {b - a} < (k + 1)b^k$$
This is where I can't make any progress. I can get the right-hand side to read ##(k + 2)b^{k + 1}## but doing so leaves the left-hand side of the inequality in a state that I can't get it to ##\frac {b^{k + 2} - a^{k + 2}} {b - a}##.
 
Physics news on Phys.org
You don't need to use induction here.
The relevant equation you are missing is <br /> b^{n+1} - a^{n+1} = (b-a)(b^n + ab^{n-1} + \dots + a^{n-1}b + a^n)<br />
 
  • Like
Likes Entertainment Unit
Thank you! I went down the path of proving it directly but struggled with that too.

Here's my completed proof:

Proof: Suppose

$$\frac {b^{n + 1} - a^{n + 1}} {b - a} < (n+1)b^n$$

It follows that
$$\frac {(b - a)(b^n + ab^{n - 1} + \dots + a^{n - 1}b + a^n)} {b - a} < (n+1)b^n$$
$$b^n + ab^{n - 1} + \dots + a^{n - 1}b + a^n < (n+1)b^n$$
$$b^n < (n+1)b^n$$

which is true for ##b \gt 0, n \geq 1##. Therefore,

$$\frac {b^{n + 1} - a^{n + 1}} {b - a} < (n+1)b^n\text{ ■}$$
 
Last edited:
The proof is even easier: It follows from 0 \leq a &lt; b that b^{n-k} a^{k} &lt; b^n for 1 \leq k \leq n. Hence
<br /> \frac{b^{n+1} - a^{n+1}}{b-a} = \sum_{k=0}^n b^{n-k}a^k &lt; \sum_{k=0}^n b^n = (n+1)b^n.<br />
 
  • Like
Likes Entertainment Unit
pasmith said:
The proof is even easier: It follows ...
Thanks for this!
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks

Similar threads

Back
Top