Help with an arithmetic proof by induction

Click For Summary

Homework Help Overview

The discussion revolves around proving an inequality involving two variables, \(a\) and \(b\), under the condition \(0 \leq a < b\). The specific inequality to be proven is \(\frac {b^{n + 1} - a^{n + 1}} {b - a} < (n + 1)b^n\), with an emphasis on using mathematical induction as a potential method of proof.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the use of mathematical induction, with one attempting to establish a basis case and an inductive step. Others suggest alternative approaches, including direct proof and leveraging known algebraic identities. Questions arise regarding the necessity of induction and the clarity of the proof structure.

Discussion Status

Several participants have contributed different perspectives on the proof, with some providing completed proofs and others questioning the approach of induction. There is a mix of attempts to clarify the reasoning behind the inequality and to explore simpler methods of proof. No explicit consensus has been reached, but multiple interpretations and methods are being explored.

Contextual Notes

Participants note that the problem does not seem to require induction, and some express difficulty in progressing through the inductive step. There is also mention of specific conditions under which the inequality holds, such as \(b > 0\) and \(n \geq 1\).

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   Reactions: 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   Reactions: Entertainment Unit
pasmith said:
The proof is even easier: It follows ...
Thanks for this!
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K