Tuesday, 11 April 2017

discrete mathematics - Help finishing proof via induction for a summation



So I have to prove the following equation using induction for n >= 2:
ni=14/5i<1
However the question asks me to prove something stronger such as this:

ni=14/5i<=115n
first to imply the first equation is true.
So far I have the following:



Base Case:
Let n = 2



2i=14/5i=45+425=2425
then I also applied it to
115n1152=2425
Therefore I can make the following assumptions yes?



Inductive Hypothesis
for all 2 <= n <= k it is
ni=14/5i=415n1151=115n<1
Inductive Step
Hopefully I'm ok up to here, I'll show what I have so far for this step.
k+1i=14/5i=15k+11151=4(15k1)1545151
=154(15k)1151445151
so here I have:
4(15k)1151
which I know is:
=ki=14/5i
which is my inductive hypothesis, I am unsure of how to finish my proof from here... any help correcting or finishing the proof is very much appreciated


Answer



Hint:
k+1i=14/5i=ki=14/5i+4/5k+1

Use the induction hypothesis on the sum from 1 to k and simplify.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...