Prove with mathematical induction

In summary: Hence, this is $P_{k+1}$, which we derived from $P_{k}$, and so we have completed the proof by... induction.
  • #1
theakdad
211
0
With mathematical induction i should prove that is true for all natural numbers:http://img.tapatalk.com/d/13/10/18/u6epesu5.jpg
Im sorry beacuse i have inserted an image,but I am still not used to write it in \(\displaystyle here...\)
 
Last edited:
Physics news on Phys.org
  • #2
The first thing you want to do is show that the base case is true, that is, to show that it holds for $n=1$. Can you demonstrate this?
 
  • #3
MarkFL said:
The first thing you want to do is show that the base case is true, that is, to show that it holds for $n=1$. Can you demonstrate this?

12*(1+1)2/4 = 1
So i believe that's true if N = 1
 
  • #4
andreask said:
12*(1+1)2/4 = 1
So i believe that's true if N = 1

I would actually write:

\(\displaystyle 1^3=\frac{1^2(1+1)^2}{4}\)

\(\displaystyle 1=1\)

So, yes, the base case $P_1$ is true. So next, state the induction hypothesis $P_k$. Just replace $n$ with $k$ in what you are trying to prove.
 
  • #5
MarkFL said:
I would actually write:

\(\displaystyle 1^3=\frac{1^2(1+1)^2}{4}\)

\(\displaystyle 1=1\)

So, yes, the base case $P_1$ is true. So next, state the induction hypothesis $P_k$. Just replace $n$ with $k$ in what you are trying to prove.

I have to prove it for n+1
 
  • #6
andreask said:
I have to prove it for n+1

You want to prove it is true for all $n\in\mathbb{N}$, that is, for all natural numbers $n$. So, state the induction hypothesis $P_k$...and then see if you can derive $P_{k+1}$ by adding what is needed to both sides, this is called the inductive step.

The induction hypothesis $P_{k}$ is:

\(\displaystyle 1^3+2^3+3^3+\cdots+k^3=\frac{k^2(k+1)^2}{4}\)

Now, what do you suppose a good inductive step would be? What would need to be added to the left side so that it would correspond to $P_{k+1}$? Once you decide what this is, then add it to both sides of $P_{k}$, and then see if the right side can be written as it is for $P_{k}$, but with $k$ replaced by $k+1$.

Once you do this, then you will have derived $P_{k+1}$ from $P_{k}$ and thereby completed the proof by induction.
 
  • #7
MarkFL said:
You want to prove it is true for all $n\in\mathbb{N}$, that is, for all natural numbers $n$. So, state the induction hypothesis $P_k$...and then see if you can derive $P_{k+1}$ by adding what is needed to both sides, this is called the inductive step.

The induction hypothesis $P_{k}$ is:

\(\displaystyle 1^3+2^3+3^3+\cdots+k^3=\frac{k^2(k+1)^2}{4}\)

Now, what do you suppose a good inductive step would be? What would need to be added to the left side so that it would correspond to $P_{k+1}$? Once you decide what this is, then add it to both sides of $P_{k}$, and then see if the right side can be written as it is for $P_{k}$, but with $k$ replaced by $k+1$.

Once you do this, then you will have derived $P_{k+1}$ from $P_{k}$ and thereby completed the proof by induction.
\(\displaystyle 1^3+2^3+3^3+\cdots+k^3+(k+1)^3=\frac{k^2(k+1)^2}{4}+(k+1)^3\) ??
 
  • #8
andreask said:
\(\displaystyle 1^3+2^3+3^3+\cdots+k^3+(k+1)^3=\frac{k^2(k+1)^2}{4}+(k+1)^3\) ??

Yes, that's right! :D

So, you want to see if the right side can be written as:

\(\displaystyle \frac{(k+1)^2((k+1)+1)^2}{4}\)

As you can see, factoring would be a good first step...
 
  • #9
MarkFL said:
Yes, that's right! :D

So, you want to see if the right side can be written as:

\(\displaystyle \frac{(k+1)^2((k+1)+1)^2}{4}\)

As you can see, factoring would be a good first step...

Can u show me please? I am off the work,dont have time now...will come at the evening! Thank you again!
 
  • #10
andreask said:
Can u show me please? I am off the work,dont have time now...will come at the evening! Thank you again!
Hello,
This explain how induction proof works Proof by Induction | Induction | Khan Academy
Regards,
\(\displaystyle |\pi\rangle\)
 
  • #11
Will try that,thank you!
 
  • #12
andreask said:
Can u show me please? I am off the work,dont have time now...will come at the evening! Thank you again!

Try factoring out \(\displaystyle \frac{(k+1)^2}{4}\). What do you get?
 
  • #13
MarkFL said:
Try factoring out \(\displaystyle \frac{(k+1)^2}{4}\). What do you get?

\(\displaystyle \frac{k^2(k+1)^2+4(k+1)^3}{4}\)

Now i think i got it..i know where my problem is,im not good in factoring out,any ideas how can i become better?
 
  • #14
andreask said:
\(\displaystyle \frac{k^2(k+1)^2+4(k+1)^3}{4}\)

Now i think i got it..i know where my problem is,im not good in factoring out,any ideas how can i become better?

Try factoring that further...the two terms in the numerator have a common factor of $(k+1)^2$.
 
  • #15
MarkFL said:
Try factoring that further...the two terms in the numerator have a common factor of $(k+1)^2$.

Its \(\displaystyle \frac{(k+1)^2(k+2)^2}{4}\)

So the left and right side are the same, that proves that P is good for all natural numbers,right?
 
  • #16
andreask said:
Its \(\displaystyle \frac{(k+1)^2(k+2)^2}{4}\)

So the left and right side are the same, that proves that P is good for all natural numbers,right?

Yes, and we can now write:

\(\displaystyle 1^3+2^3+3^3+\cdots+k^3+(k+1)^3=\frac{(k+1)^2((k+1)+1)^2}{4}\)

I wrote the right side that way to make it clear that it now has $k+1$ everywhere that $P_{k}$ has $k$.

Hence, this is $P_{k+1}$, which we derived from $P_{k}$, and so we have completed the proof by induction.
 
  • #17
MarkFL said:
Yes, and we can now write:

\(\displaystyle 1^3+2^3+3^3+\cdots+k^3+(k+1)^3=\frac{(k+1)^2((k+1)+1)^2}{4}\)

I wrote the right side that way to make it clear that it now has $k+1$ everywhere that $P_{k}$ has $k$.

Hence, this is $P_{k+1}$, which we derived from $P_{k}$, and so we have completed the proof by induction.

Thank you very much!
 

FAQ: Prove with mathematical induction

What is mathematical induction?

Mathematical induction is a method of mathematical proof used to prove statements about a set of numbers or objects that follow a pattern. It involves proving that the statement is true for a base case, and then showing that if it is true for any one case, it must also be true for the next case or any other case after that.

How does mathematical induction work?

Mathematical induction follows the basic steps of:1. Proving the statement is true for a base case.2. Assuming the statement is true for a particular case.3. Proving that if the statement is true for that case, it must also be true for the next case.By repeating step 3, we can show that the statement is true for all cases and therefore, prove it using mathematical induction.

What are the different types of mathematical induction?

There are two types of mathematical induction: strong induction and weak induction. Strong induction involves the use of multiple base cases to prove the statement for all cases, while weak induction only uses one base case and relies on the previous case to prove the next one.

When should mathematical induction be used?

Mathematical induction should be used when trying to prove statements that follow a pattern or can be broken down into smaller cases. It is particularly useful for proving statements about sequences, series, and other mathematical structures.

What are some common mistakes made when using mathematical induction?

Some common mistakes when using mathematical induction include:- Not proving the base case.- Assuming the statement is true for all cases without proving it.- Skipping steps in the proof.- Using incorrect or incomplete mathematical reasoning.To avoid these mistakes, it is important to carefully follow the steps of mathematical induction and double check all calculations and reasoning.

Similar threads

Replies
8
Views
2K
Replies
4
Views
2K
Replies
4
Views
3K
Replies
1
Views
5K
Replies
11
Views
987
Replies
2
Views
2K
Back
Top