Prove by Induction: $w_k = w_{k-2} + k$

  • Thread starter Thread starter Arew
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary

Homework Help Overview

The discussion revolves around proving by induction the formula $$w_k = w_{k−2} + k$$ for all integers $$k \ge 3$$, with initial conditions $$w_1 = 1$$ and $$w_2 = 2$$. Participants also reference an explicit formula for $$w_n$$ based on whether $$n$$ is odd or even.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the inductive step for odd integers and question whether proving the case for $$w_{k + 2}$$ is sufficient, or if $$w_{k + 1}$$ also needs to be addressed. There is a focus on verifying the induction base and handling even integers.

Discussion Status

There is ongoing exploration of the inductive proof, with participants clarifying the necessity of addressing both odd and even cases. Some guidance has been offered regarding the structure of the proof, but no consensus has been reached on the handling of specific cases.

Contextual Notes

Participants note the importance of verifying the induction base and express concerns about proving the formula for every integer rather than just every other integer. There is also mention of a typo that may affect clarity.

Arew
Messages
7
Reaction score
0

Homework Statement


Prove by induction $$w_k = w_{k−2} + k$$, for all integers $$k \ge 3, w_1 = 1,w_2 = 2$$ has an explicit formula
$$ w_n =\begin{cases}
\frac{(n+1)^2}{4}, & \text{if $n$ is odd} \\
\frac n2(\frac n2 + 1), & \text{if $n$ is even}
\end{cases}$$


Homework Equations



The Attempt at a Solution


[/B]
Inductive step for when n is odd:

Suppose $$w_k = \frac{(k+1)^2}{4}$$ if k is odd. Then by definition of w, we have $$w_{k + 2} = w_k + k + 2 = \frac{(k+1)^2}{4} + k + 2 = \frac {k^2 + 2k + 1}{4} + k + 2= \frac {k^2 + 6k + 8}{4} = \frac {(k +3)^2}{4} $$ if k + 2 is odd.

Is it important that we prove $$w_{k + 1} = \frac{(k+2)^2}{4}$$ if k+ 1 is odd or is the proof for $$w_{k + 2} = \frac{(k+3)^2}{4}$$ if k + 2 is enough?

If none of the above makes sense, can I please get help getting started with the inductive step.
 
Physics news on Phys.org
Arew said:

Homework Statement


Prove by induction $$w_k = w_{k−2} + k$$, for all integers $$k \ge 3, w_1 = 1,w_2 = 2$$ has an explicit formula
$$ w_n =\begin{cases}
\frac{(n+1)^2}{4}, & \text{if $n$ is odd} \\
\frac n2(\frac n2 + 1), & \text{if $n$ is even}
\end{cases}$$


Homework Equations



The Attempt at a Solution


[/B]
Inductive step for when n is odd:

Suppose $$w_k = \frac{(k+1)^2}{4}$$ if k is odd. Then by definition of w, we have $$w_{k + 2} = w_k + k + 2 = \frac{(k+1)^2}{4} + k + 2 = \frac {k^2 + 2k + 1}{4} + k + 2= \frac {k^2 + 6k + 8}{4} = \frac {(k +3)^2}{4} $$

It's fine to here. That's the odd numbers sorted out. Now, what about the even numbers?
 
Arew said:

Homework Statement


Prove by induction $$w_k = w_{k−2} + k$$, for all integers $$k \ge 3, w_1 = 1,w_2 = 2$$ has an explicit formula
$$ w_n =\begin{cases}
\frac{(n+1)^2}{4}, & \text{if $n$ is odd} \\
\frac n2(\frac n2 + 1), & \text{if $n$ is even}
\end{cases}$$


Homework Equations



The Attempt at a Solution


[/B]
Inductive step for when n is odd:

Suppose $$w_k = \frac{(k+1)^2}{4}$$ if k is odd. Then by definition of w, we have $$w_{k + 2} = w_k + k + 2 = \frac{(k+1)^2}{4} + k + 2 = \frac {k^2 + 2k + 1}{4} + k + 2= \frac {k^2 + 6k + 8}{4} = \frac {(k +3)^2}{4} $$ if k + 2 is odd.

Is it important that we prove $$w_{k + 1} = \frac{(k+2)^2}{4}$$ if k+ 1 is odd or is the proof for $$w_{k + 2} = \frac{(k+3)^2}{4}$$ if k + 2 is enough?

If none of the above makes sense, can I please get help getting started with the inductive step.
And the induction base? You have to verify this, too. It is really important and not just something annoying.
And what if k is even?
(Remark: there is a typo.)
 
PeroK said:
It's fine to here. That's the odd numbers sorted out. Now, what about the even numbers?

fresh_42 said:
And the induction base? You have to verify this, too. It is really important and not just something annoying.
And what if k is even?
(Remark: there is a typo.)

Thanks for the comments. Do we have to handle $$w_{k+1}$$ at all?
 
Arew said:
Thanks for the comments. Do we have to handle $$w_{k+1}$$ at all?
Why would you?
 
PeroK said:
Why would you?

I was worried we proved w_k for every other integer k. I see why that's wrong. Thanks.
 
Arew said:
I was worried we proved w_k for every other integer k. I see why that's wrong. Thanks.
With the induction base (two values), the odd numbers, which are covered by ##k \rightarrow k+2##, only the even are missing. What other numbers can you think of?
 
fresh_42 said:
With the induction base (two values), the odd numbers, which are covered by ##k \rightarrow k+2##, only the even are missing. What other numbers can you think of?

Can't think of anything else :) Thanks.
 

Similar threads

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