Ask
your own question, for FREE!
Mathematics
8 Online
OpenStudy (anonymous):
PROOF BY INDUCTION HELP PLZ!!
http://puu.sh/bTJQ3/402ed736ee.png
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
@iambatman help please :S
OpenStudy (anonymous):
@gorv
OpenStudy (gorv):
for n=1
OpenStudy (anonymous):
do i have to do induction for k AND n? (since there are 2 variables..)
OpenStudy (gorv):
no only one we hake to check
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (gorv):
first for n=1
than n=k
and than n=k+1
OpenStudy (anonymous):
either one?
OpenStudy (gorv):
all 3we have to test ...
OpenStudy (anonymous):
so it's a long induction proof..?
OpenStudy (gorv):
yeah :P
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
thanks ill try
OpenStudy (gorv):
for n=1
K+1>=K+1 true
now let for n=k
(k+1)^k>= 1 +k*K
OpenStudy (gorv):
now for n=k+1
(k+1)^(k+1)>=1+k*(k+1)
(k+1)^(k+1)>=1+k^2+k
((k+1)^k)(k+1)>=1+k^2+k
we considered
k+1)^K>=1+k*k
so
((k+1)^k)(k+1) >=1+k^2+k
ganeshie8 (ganeshie8):
n=1 :
(1+k)^1 >= 1+k*1 true
assume (1+k)^n >= 1+kn for some n
multiply both sides by (1+k) :
(1+k)(1+k)^n >= (1+k)(1+kn)
(1+k)^(n+1) >= 1+k + kn + k^2n
>= 1 + (n+1)k + k^2n
>= 1 + (n+1)k
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!