Proof by Mathematical Induction

Click For Summary

Discussion Overview

The discussion revolves around the proof of the formula for the sum of the first n odd numbers using mathematical induction. Participants explore the steps involved in the induction process, including the base case, the induction hypothesis, and the inductive step.

Discussion Character

  • Homework-related
  • Mathematical reasoning

Main Points Raised

  • One participant expresses confusion regarding the application of mathematical induction to prove that the sum of the first n odd numbers equals n squared.
  • Another participant outlines the initial steps of the proof, confirming the base case and stating the induction hypothesis.
  • A subsequent post reiterates the steps of the proof, indicating uncertainty about how to proceed with the inductive step.
  • One participant clarifies that the inductive step involves adding terms to the induction hypothesis and suggests incorporating these into the sum.
  • A later reply provides a complete derivation of the inductive step, demonstrating how to rewrite and factor the expression to arrive at the conclusion.

Areas of Agreement / Disagreement

Participants generally agree on the steps involved in the proof by induction, but there is uncertainty expressed by some regarding the inductive step. The discussion reflects a progression from confusion to a more complete understanding, though not all participants may fully agree on the clarity of the inductive step.

Contextual Notes

Some participants may have missing assumptions about the properties of summation or algebraic manipulation, which could affect their understanding of the inductive step.

needmathhelp1
Messages
2
Reaction score
0
I am confused on a math problem. I am supposed to use mathematical induction to show that

(Summation with n on top and i=1 on the bottom) (2i-1) = 1+3+5+...+(2n-1)= n^2
 
Physics news on Phys.org
We are given to prove:

$$S_n=\sum_{i=1}^n(2i-1)=n^2$$

Step 1: demonstrate the base case is true.

$$S_1=\sum_{i=1}^1(2i-1)1=1^2$$

This is true.

Step 2: State the induction hypothesis $P_k$:

$$S_k=\sum_{i=1}^k(2i-1)=k^2$$

Step 3: Make the inductive step, and obtain $P_{k+1}$.

What do you get if you add $2k+1$ to both sides?
 
MarkFL said:
We are given to prove:

$$S_n=\sum_{i=1}^n(2i-1)=n^2$$

Step 1: demonstrate the base case is true.

$$S_1=\sum_{i=1}^1(2i-1)1=1^2$$

This is true.

Step 2: State the induction hypothesis $P_k$:

$$S_k=\sum_{i=1}^k(2i-1)=k^2$$

Step 3: Make the inductive step, and obtain $P_{k+1}$.

What do you get if you add $2k+1$ to both sides?

I understand the first two steps, but I am not sure what the inductive step is or how to obtain $P_{k+1}$.
 
The inductive step is essentially a legal algebraic operation you perform on $P_k$ that leads to $P_{k+1}$, usually after some simplification.

If you use the step I suggested, you then have:

$$\sum_{i=1}^k(2i-1)+2k+1=k^2+2k+1$$

Can you incorporate the added terms into the sum on the left and factor the right?
 
Since several days has gone by with no feedback from the OP, I will finish. We have:

$$\sum_{i=1}^k(2i-1)+2k+1=k^2+2k+1$$

On the left side, rewrite the added terms so that they are in the form of the summand:

$$\sum_{i=1}^k(2i-1)+2(k+1)-1=k^2+2k+1$$

Incorporate these terms into the sum and factor the right side as a square:

$$\sum_{i=1}^{k+1}(2i-1)=(k+1)^2$$

We have now derived $P_{k+1}$ from $P_k$, thereby completing the proof by induction.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K