use mathematical induction to prove the statements in these excercises. Note that some of these statements can also be proved be other methods.
n over sigma over I=1, then prove that 2^i-1=(2^n)-1:eek:
![]() |
use mathematical induction to prove the statements in these excercises. Note that some of these statements can also be proved be other methods.
n over sigma over I=1, then prove that 2^i-1=(2^n)-1:eek:
or
I guess what I want to know is what you need to prove. Is it
or
------------------------
Then prove that
Is this what you want?
What is σ? Are we talking about the standard deviation here, or something else?
I believe they mean the capital summation sigma.
is true because
Assume true for
Show true for
It is true for the (k+1)st case, therefore, it is true for all cases and it is proven.
By that problem statement, I can see why you got confused. :confused::rolleyes:
All times are GMT -7. The time now is 03:41 PM. |