I could not just give a thumbs-up and move on. This video earns it place as the best on this topic. I was lost after our class lecture, now I am able to do the practice questions on my own. Thanks Professor Brehm.
Thanks! I just finished some new videos on recurrence relations in my discrete math II series (under construction) if you need a deeper understanding. Thanks for watching!
at the 6 min mark, shouldnt our first term by a^1 bc the smallest n value should be 1, correct? you specified n belongs to domain of Z+ (positive integers). yet for your first term of an, your n variable = 0. your first term is a^0
I dont understand how the recursive step works for the fibonacci sequence. the values produced by the math past 5 dont occur in the set. Am I missing something?
Hi Ms Brehm! I just want to ask because I noticed its not here, but why didn't you go over 3.2 "Growth of Functions"? I am really struggling with that concept, and also I noticed that you skipped some lessons, is there a reason for that? I really enjoy your videos you've helped me for my entire semester and I thank you sincerely, but I am just curious as to why you skipped certain chapters. Thank you, and have a good day.
Hello Kimberly, I would your help in computing a closed formula for a recurrence relation. When is it best to use the iteration technique and characteristic root technique. A video lecture covering highly appreciated
I wish I could give you my share of the money that goes towards my professor's salary.
You saved my semester.
Thank you!
I could not just give a thumbs-up and move on. This video earns it place as the best on this topic. I was lost after our class lecture, now I am able to do the practice questions on my own. Thanks Professor Brehm.
Thanks! I just finished some new videos on recurrence relations in my discrete math II series (under construction) if you need a deeper understanding. Thanks for watching!
@@SawFinMath I appreciate your videos and mostly certainly will watch your videos in discrete math ll series
at the 6 min mark, shouldnt our first term by a^1 bc the smallest n value should be 1, correct? you specified n belongs to domain of Z+ (positive integers). yet for your first term of an, your n variable = 0. your first term is a^0
yeah, I noticed this too
I'm wondering this too
you're amazing tysm for these videos
I dont understand how the recursive step works for the fibonacci sequence. the values produced by the math past 5 dont occur in the set. Am I missing something?
Life saver.❤
How do you record your screen/ setup your presentation?
Hi Ms Brehm! I just want to ask because I noticed its not here, but why didn't you go over 3.2 "Growth of Functions"? I am really struggling with that concept, and also I noticed that you skipped some lessons, is there a reason for that? I really enjoy your videos you've helped me for my entire semester and I thank you sincerely, but I am just curious as to why you skipped certain chapters. Thank you, and have a good day.
I only make videos for the sections I cover in class. I have plans to make videos for every section of the book, but that won't happen for a bit.
@@SawFinMath please please make a video on thoes
Hello Kimberly,
I would your help in computing a closed formula for a recurrence relation. When is it best to use the iteration technique and characteristic root technique. A video lecture covering highly appreciated
Thanks