#3 Principle of mathematical induction prove proof 1+5+9+...+(4n-3)=n(2n-1)

preview_player
Показать описание
Prove

Math Tutorials Links
Algebra
Foundations

Equations

Inequalities
Solve Systems of Equations by Graphing







TESTS

Рекомендации по теме
Комментарии
Автор

Yeah this method of induction is sooo much easier. The way the book shows it and the way I've seen professors teach it is for P(k+1): 1+5+9+...+(4k-3)+[4(k+1)-3] = k(2k-1)+[4(k+1)-3] and you start off with the two sides equal to each other and then work towards getting the RHS to look like the form of the RHS of the P(k) hypothesis. The goal is to get your RHS of your P(k+1) hypothesis to be (k+1)(2(k+1)-1).

BUT that way is much harder for sure, because it involves a lot of clever factoring and such. The method in the video should be valid because when I let k = 1 for k(2k-1)+[4(k+1)-3] = (1)(2-1)+[4(1+1)-3] = 1 + 5 = 6. Which is what I arrive at when I let k = 1 for your method of the RHS of P(k+1) hypothesis: (k+1)[2(k+1)-1] = (1+1)[2(1+1)-1] = 2 x 3 = 6.

chunkylover
Автор

Thank you very much. I couldn't get this in class, but now it's all clear. Thanks a lot!

rafaellima
Автор

Thanks m8, u explain it waaaayy better then ma teacher :D

TheFightmaster
Автор

thank you sir where is number 4 plz

seekerloka
Автор

nice video helps a lot thanks for the curse 

ujustfoundanobject