A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 3 years ago
i need help ..
anonymous
 3 years ago
i need help ..

This Question is Open

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0@Bugay♥ Hi :) \(\huge \color{red}{\text{Welcome to Open Study}}\ddot\smile\) Post a specific question, and we'll try our best to help you :)

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0by the method of mathematical induction prove that the following are valid for all positive values of n. 1.) n^3+2n is divisible by 3 2.) 2+2^2+2^3+ . . . + 2^n = n^2(2n^21)

DLS
 3 years ago
Best ResponseYou've already chosen the best response.0Satisfy by k Satisfy by k+1

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0welcome :) do you know general steps for proving an identity by mathematical induction ?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0basis of induction , induction hypothesis and proof of induction..

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0First we prove the result for n= 1 so, put n=1 in n^3+2n and check whether the answer is divisible by 3 .

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.03 is divisible by 3 then?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0hartnn : i thought you will help me.. ???

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0i am sorry, i keep on getting disconnected..

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0well, next step is to assume the result true for n=k so, k^3+2k is divisible by 3>(A)

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0now, using (A), we need to prove the result for n=k+1 that is, prove (k+1)^3+2(k+1) is divisible by 3

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.0using the fact that k^3+2k is divisible by 3 can you do that ? try it...

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0no i cant :(( can you do it for me?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@hartnn : its okey thank you so much..

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0hey m doing the problem... ill help u out in a bit

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@Tushara : i wish you can help me with this..

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0does the second proof have any rule on n? like n>1?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0the second proof is not true for n=1

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0well then u cant prove the second one.... its just not true

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0let me check the given..

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0we have to put n=1 to n^2(2n^21) right?? and if it is equal to 1 .. the theorem is true for n=1

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.02^n=n^2(2n^21) for n=1 which is not true

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0its not true for n=2 either

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0oops im sorry the given was wrong.. it should be 2+2^2+2^3+ . . . + 2^n = 2^(n+1)  2

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0okay,... well its a very easy proof... prove true for n=1, assume true for n=k, then prove true for k+1

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0it is now true for n=1 right?? then? what i am going to do?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0@Kira_Yamato : still i thank you..

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0now prove true for n=k+1

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0then?? i find difficulty in proof of induction :((

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0have u practiced any induction problems before? if u have some induction examples in ur math text book... please go thru them

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0all u have to do is this: prove that 2^(n+1)2+2^(n+1)=2(n+2)2

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0my teacher dont taught mathematical induction to us.. i havent encounter it before..

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0if u cant prove the above equation^ den its best for u to not study ahead and wait for ur teacher to teach u... just see if u can prove the above

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.02^(n+1)2+2^(n+1)=2^(n+2)2 sorry i typed it up wrong before

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0what should i prove? if it is equal?

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0yes its equal... dats all u have to do for that question
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.