Mathematical Induction

[@blackredwhite8417]

The first video that was explained in human language, thanks you so much Dr. Newton

[@WhatAmI-JB]

You make things so clear that any one cam understand.Thats what teaching is all about;ie to make others understand what you are talking about. Not sll can do that.Thanks.

[@XX-sf1eh]

This is the first time that I've understood induction. Thanks a lot. 😃

[@UendjipaKuruuo]

not just you alone likewise. He even made me understand the epsilon delta proof for limits

[@emmanuelmusa-j3h]

Thanks bro wakanyanya iwewe lm telling all my friends about you here in Zimbabwe @ Chinhoyi University of Technology....

[@PrimeNewtons]

Glad you like it.

[@LillyMusaq]

😢You didn't tell.some of us found this guy a little late 😂

[@jensberling2341]

Dr. Newton, I really appreciates all your works in mathematics on the,platform KZbin. It is so good to see your care for students by showing them your outstanding understanding of mathematics. Your clear thinking is an example to be inspired by in our lifelong learning.

[@josephparrish7625]

This is the first topic I remember studying in College Algebra so many many years ago. Fun!!

[@paul9086]

Your presentations and explanations are just stellar. Thank you so much.

[@epsilonxyzt]

Never stop teaching!

[@skwbusaidi]

In the step 3k(k+1) + 6(k+1) We can factor 3(k+1)directly without expanding 3(k+1)(k+2)

[@dailychinese1396]

Wow 🤩 love it 😻 Thanks 😊

[@PrimeNewtons]

I'm glad you like it

[@JevasOnyekachi]

Plz can I have ue what'sApp number sir??​@@PrimeNewtons

[@mikethorner]

Thank you so much. I would always get mixed up with placement of the n and the k.

[@EatswithYem]

You’re the bestttttttttttt every other video was so complicated and TRASH

[@AmandaKimani-jn5ko]

I did it.

[@sfundomsezane]

do you have a video for Division algorithm for integers

[@PrimeNewtons]

Next video

[@holyshit922]

What about this case Let T_{n}(x) = sum_{k=0}^{\lfloor\frac{n}{2} floor}sum_{m=k}^{\lfloor\frac{n}{2} floor}(-1)^{k}{n \choose 2m}\cdot{m \choose k} x^{n-2k} moreover we know that our T_{n}(x) should satisfy following recurrence relation T_{0}(x) = 1 T_{1}(x) = x T_{n+1}(x)=2xT_{n}(x) - T_{n-1}(x) , n>0 Can we prove that T_{n}(x) = sum_{k=0}^{\lfloor\frac{n}{2} floor}sum_{m=k}^{\lfloor\frac{n}{2} floor}(-1)^{k}{n \choose 2m}\cdot {m \choose k} x^{n-2k} by mathematical induction and how it looks like

[@dailychinese1396]

I can send you more equations 🤣😂😂😂😅

[@PrimeNewtons]

Let's goooooooooo!!!!