SOLUTION: Can you help me with this? Thank you.
I need to prove a series by the principal of mathematical induction.
sigma sign (up=n, down=(k=0))2^k=2^(n+1)-1
Algebra.Com
Question 1093613: Can you help me with this? Thank you.
I need to prove a series by the principal of mathematical induction.
sigma sign (up=n, down=(k=0))2^k=2^(n+1)-1
Found 2 solutions by stanbon, greenestamps:
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
sigma sign (up=n, down=(k=0))2^n =2^(n+1)-1
1st:: Show it is true for k = 0
2^0 = 2^(0+1)-1
1 = 2*1-1
1 = 1
-----------------
2nd:: Assume it is true for n = k::
2^k = 2^(k+1)-1
-------------------------
3rd:: Show that it is true for n = k+1::
2^(k+1) = 2*2^k = 2[2^(k+1)-1] = 2^(k+2)-2 = 2^[(k+1)+1]-2
Note:: It is not true in general::
E.G.:: not true for n = 1
2^1 = 2^(1+1)-1
2 = 2^2-1
2 = 3
Is not true
-------------
Cheers,
Stan H.
--------------
Answer by greenestamps(13200) (Show Source): You can put this solution on YOUR website!
To prove a formula using mathematical induction, you need to
(1) prove it is true for some "beginning" value (usually 0 or 1); and
(2) show that if it is true for some value k then it follows that it is also true for k+1.
Having shown that the formula is true for some beginning value, and having shown that its being true for any number implies that it is also true for the next number, we can conclude that it is true for any number.
The formula you are trying to prove is
2^0 + 2^1 + 2^2 + ... + 2^n = 2^(n+1)-1
Step (1): Show the formula is true for n=1. For n=1, the formula says
2^0 + 2^1 = 2^2-1
1+2 = 4-1
3 = 3
The formula is true for n=1; we have finished step (1).
Step (2): assume the formula is true for some value k, then show that it follows that it is also true for k+1.
For n=k, the formula says
2^0 + 2^1 + 2^2 + ... + 2^(k-1) + 2^k = 2^(k+1)-1
We assume that is a true statement, and we show that it follows that the formula is also true for (k+1). For (k+1), the formula says
2^0 + 2^1 + 2^2 + ... + 2^(k-1) + 2^k + 2^(k+1) = 2^(k+2)-1
What we need to show is that we get exactly that expression when we add the next power of 2.
We know the sum of all terms but the last on the left is equal to 2^(k+1)-1 (it is what we assumed....). So now let's add the last term to this expression and simplify:
(2^(k+1)-1) + 2^(k+1) = 2^(k+1) + 2^(k+1) - 1 = 2(2^(k+1))-1 = 2^(k+2)-1
And that is exactly what we wanted to show.
We have completed both of the required steps to show by mathematical induction that the formula is true for all values of n.
RELATED QUESTIONS
Use mathematical induction to prove 3 is a factor of 4^n - 1. I'm realky confused. Please (answered by greenestamps)
Please help me with this mathematical induction question:
Suppose we want to use... (answered by ikleyn)
Hello this is a mathematical induction question i need help with.
show that 5^(k+2) -... (answered by robertb)
Please help me work out this algebra problem in series. There is an infinity symbol on... (answered by ikleyn)
Hello please help me solve this mathematical induction question, using "replacement... (answered by ikleyn)
Please help me solve and explain how to solve this mathematical induction:
Use... (answered by Edwin McCravy)
Hello I require your help for this mathematical induction question, using "replacement... (answered by ikleyn,robertb)
I'm sorry for asking this again but the way I typed this up the last time was quite... (answered by Edwin McCravy)
please help me with this
use the method of mathematical induction to prove the following
(answered by math-vortex)