RECURRENCE RELATIONS - DISCRETE MATHEMATICS

preview_player
Показать описание
Leanr about recurrence relations and how to write them out formally.

#DiscreteMath #Mathematics #RecurrenceRelations

*--Playlists--*

*--Recommended Textbooks--*

In this video we introduce recurrence relations, specifically looking at geometric progressions and arithmetic progressions.

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.
Рекомендации по теме
Комментарии
Автор

My data structures professor jumped into recurrence relations without explaining them, ignoring the fact that discrete math isn't a prerequisite course. Your explanation is A+, thanks so much!

thejo
Автор

College class is joke, have to look for great videos on youtube like this one anyway

kyrieirving
Автор

Why did i go to lectures the whole semester when i can spend 15 min watching this video and understand everything... Great work!

jrgenbrve
Автор

Wow, honestly this is the most clear I've ever seen this. good job, it actually makes sense to me

astyanax
Автор

Missed the lecture on this topic last week with the midterm fast approaching, and you explained this better than my textbook ever could. 10/10

gehenna
Автор

omg that at the end, this guy cares about us more than he cares about the views
10/10

newleafoverit
Автор

Currently, I can't understand anything in my Discrete Mathematics class, but these videos are an extremely good resource.

clkinder
Автор

My teacher taught me this in class 12 and I forgot it until recently I was required to use it in discreet mathematics, this video was a perfect revision covering all topics and I can solve any questions again from this topic. Thanks 😊

shivanshsingh
Автор

That was pretty helpful, and the proof at the end was nice. I’ve always used that sum but never knew the proof

brecoldyls
Автор

Thanks a lot! Just want to point out a small error though; at 11:50, a(n) should be equal to the sum of 2i from i=1 to n, instead of 2n from i=1 to n (since that'd just be 2n^2)

LionHeartSamy
Автор

one hour before discrete mathematics
youtube history: *full of discrete maths tutorial*

snydex
Автор

Dear Tutor!
I am Student of BS math, believe me that your conveying method is marvelous.
i feel honored in my fellows Specially when i give examples of Fibonacci numbers to explain
Keep it Stay Blessed.

multibrainhacker
Автор

Love the KhanAcademy style video. My Algorithms professor jumped right into recurrence relations with no logical order or structure to the lecture so this really helped me.

ProtonChicken
Автор

This is how mathematics should be taught! Brilliant!

alvinkatojr
Автор

Lol. As long as it will help to compute excellent algorithm and write excellent programs, I will share it quickly to friends asap

patientson
Автор

Thank you so much man, if it weren't for you, I wouldn't have been able to get through my finals.

ChenukaGamage
Автор

Videos like this are honestly a godsend. Thank you so much!

xaravox
Автор

Thanks man, you are saving my midterm test!!!

陳翰儒-dm
Автор

with mid-terms being 2 days away and me not really understanding what my DM professor has taught, your videos helps a lot, A LOT. subbed

cerealmurderer_nr
Автор

THANK YOU VERY MUCH SIR ITS ABOUT TO BOUNCE OFF MY HEAD AND FOUND THIS👍❤️

ushachandankar