The first video that was explained in human language, thanks you so much Dr. Newton
@XX-sf1eh
7 ай бұрын
This is the first time that I've understood induction. Thanks a lot. 😃
@user-sw7rw3px6n
4 ай бұрын
not just you alone likewise. He even made me understand the epsilon delta proof for limits
@jensberling2341
4 ай бұрын
Dr. Newton, I really appreciates all your works in mathematics on the,platform KZitem. 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.
@user-hc2cm1be7d
8 ай бұрын
Thanks bro wakanyanya iwewe lm telling all my friends about you here in Zimbabwe @ Chinhoyi University of Technology....
@PrimeNewtons
8 ай бұрын
Glad you like it.
@JugMaj1940
8 ай бұрын
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.
@skwbusaidi
4 ай бұрын
In the step 3k(k+1) + 6(k+1) We can factor 3(k+1)directly without expanding 3(k+1)(k+2)
@josephparrish7625
9 ай бұрын
This is the first topic I remember studying in College Algebra so many many years ago. Fun!!
@dailychinese1396
4 жыл бұрын
Wow 🤩 love it 😻 Thanks 😊
@PrimeNewtons
3 жыл бұрын
I'm glad you like it
@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
Пікірлер: 17