RECURRENCE RELATIONS - DISCRETE MATHEMATICS

Leanr about recurrence relations and how to write them out formally.
#DiscreteMath #Mathematics #RecurrenceRelations
Support me on Patreon: bit.ly/2EUdAl3
Visit our website: bit.ly/1zBPlvm
Subscribe on KZbin: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbVgLike us on Facebook: on. 1vWwDRc
Submit your questions on Reddit: bit.ly/1GwZZrP
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.

[@thejo6331]

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!

[@AliMalik-yt5ex]

In my university, you cannot take data structures class without having passed discrete mathematics.

[@pmz558]

@@AliMalik-yt5ex what uni is it?

[@AynChat]

hmm,looks like our uni have much alike

[@jimmyli34]

@@AliMalik-yt5ex I took data structures last semester, and just now taking discrete mathematics. So mine is the opposite I guess

[@MateusKaterp]

bruh the exact same thing happened to me lol

[@kyrieirving4206]

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

[@navjotsingh2251]

I agree. Have to constantly look on KZbin for matb explanations

[@AynChat]

same goes here

[@hassankhan-xq8et]

Same goes here

[@scottmason6356]

Same goes here

[@matpro0]

same goes here

[@jrgenbrve3990]

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

[@astyanax905]

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

[@Trevtutor]

+astyanax905 Thank you!

[@gehenna151]

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

[@yungzed]

whatd u finish with

[@cerealmurderer_nr]

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

[@shivanshsingh8173]

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 😊

[@clkinder1]

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

[@brecoldyls]

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

[@newleafoverit]

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

[@multibrainhacker]

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 recur.relation........ Keep it up...... Stay Blessed.

[@xaravox]

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

[@mbalazs3544]

you get my like just by being able to explain to me what this is.....and I honestly beloved before your video I will never be capable to understand this thx man.

[@msrtrini]

Dude Thank you so much , saved me before my exam .

[@farisdurrani]

Thank you! Your explanations is so helpful for my combinatorics class!

[@alvinkatojr]

This is how mathematics should be taught! Brilliant!

[@ChenukaGamage]

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

[@gatos4840]

Keep up the good work! Clear explanations that helped me a lot!

[@user-zy8sf7tv2f]

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

[@ayushmansrivastava3349]

Excellent video , crystall clear concepts.....

[@musficamurshidopshori2512]

Thank you so much for the discrete math tutorial!

[@snydex5064]

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

[@ProtonChicken]

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.

[@AynChat]

well, they sure did well themself but failed to teaches.

[@JamesBrodski]

Thank you so much! Great video.

[@Kamnuma]

Thank you so much! This video was helpful!

[@braydenchan138]

Thank you, Tutor Trev!

[@tgg3249]

Great video, great instructor.

[@ushachandankar]

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

[@FatihAlmutawakkil]

I LOVE THIS CHANNEL!!!!! GOOD WORKKKKKKKKKK!!!!!!!

[@ramahstudio]

my discrete maths teacher has a PhD in my maths but shitty in teaching. your amazing trev

[@bartubozkurt7312]

this is fairly clear expression thank you

[@quirkyquester]

you are amazing! Thank you!

[@hubbankhan3309]

13 minute into this video and i had the aha moment!! thankyou so much trevtutor((((((:

[@LionHeartSamy]

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)

[@pchat138]

This was confusing me as well. Thanks, I get it now

[@xinliangwei8865]

I found this error too.

[@mokoepa]

I came here for this to see if I was the only one who saw it... besides.. he mentioned earlier that it's the some of i's, i ranging from 1 to n

[@catherinezhang8334]

good video! great explanations!

[@RajeshKamboj]

Thank you so much sir.

[@mochabean4325]

Thank you, my math textbook to a long and bad spoken approach to teaching this concept, this was better explained!

[@commenting000]

Hello, Trevor. I wasn't sure about your generalized formula for the segment in 11:23. I ended up trying to find a general formula and I found that An = Ao + (k * (n+1/2)) works as well. If you could clear up this misconception, that would be very helpful.

[@whiterice6663]

1 week until my G12 exams, you have saved me! Thank you from Papua New Guinea :)

[@duckynatalie]

Image studying for an exam a week in advance... Its 12:45 am right now for me... and my exam is at 8:25 am... oof lol

[@armin5767]

@@duckynatalie and you were reading comments lmao

[@duckynatalie]

@@armin5767 yep.

[@mikays3580]

Hello, sir! Thank you for your thorough explanation. I would just like to ask if a recurrence relation of a sequence is unique?

[@AynChat]

well,that was mind blowing

[@bubblesgrappling736]

the term "recurrence relation" does it descirve the kind of notation that you are using the describe datastructures here?

[@harshvirtomar6552]

You are awesome!!!

[@lalith_kumar_akhila2411]

thanks for great explanation

[@hghlndr2]

good explanation to initial conditions

[@bradleyshepard]

Trev- could you suggest an inexpensive basic text that addresses generating functions at the undergraduate level??

[@swasthikadev]

12:19 isnt it summation Ki

[@mickey46911]

+TheTrevTutor All your videos are awesome and it helps me out tremendously.

[@Justinhoou]

Hi do you have a video on backtracking method? Thanks!

[@adiletbaimyrzauulu6589]

you helped me to get my degree sir

[@crowlsyung]

Awesome video! What software do you use to record these videos??

[@glitchyplaysstuff1233]

helped me last minute back in highschool

[@yujiabing8820]

so clear/ thx

[@Noellexafael]

Ok I understand and all but I still can't do my teacher exercises 😐, this is definitely hard but thanks for the video ❤️

[@TheHiguy333]

I have an exam in an hour. Anyone else?

[@buntagkendrick887]

thank you man

[@AhamedKabeer-wn1jb]

Superb...

[@SURaviKumarChavali]

what is the digital board you used to write. please tell.. thanks in advance

[@sextolife]

Hello sir,can you please let me know the derivation of Genaral solution of the RR having root with multiplicity >=2

[@majdhaythem1462]

the best video ever on youtube !!

[@momen_ai]

for the example y you have explained: (0, 2,6,12,20,30,42..): can be written like: an = a(n-1) + 2 * a right?

[@josephmwanza5086]

well explained

[@calpherabw7471]

thank you

[@DannyPhantumm]

The f's you drew at 0:57 were beautiful.

[@MegaDonaldification]

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

[@raziel44]

Love your videos. Got a question though. Do any of your videos talk about or are you planning on talking about the Fermat Theorem? I had this assignment the other day where you had to prove that "2 to the power of 69 + 3 to the power of 69 can be divided by 7". Or something like that.

[@Trevtutor]

=(eGO)=™Raziel44 I don't have anything planned for Fermat's Theorem quite yet, sorry.

[@khadijahflowers9024]

So far, I've only learned about the Master Theorem for solving a recurrence relation which is super helpful and memorable after a few examples. But that is a formula used for recursive algorithms (from what I've seen). Is there another way to measure the time function will take to finished rather than just eye balling it? en.wikipedia.org/wiki/Master_theorem_(analysis_of_algorithms)

[@gcs4558]

which software are you using for this lecture

[@yvanbrunel9734]

I know this is old, but I'm trying to understand please: At 12:04 you said it would be 2((n)(n+1))/2 But that would be right if it was a summation of from i=1 to n of i, right? Here we are doing a summation from i=1 to n of n, so shouldn't it have been = n^2? Thanks

[@nishithamathew6289]

useful video

[@simpleepic]

You believe of not my discrete mathematics professor exactly has your slides in his lectures.

[@taneja_unchained]

Which software and device has been used to create this videos, i also want to create some videos of electronics subjects which i want to teach. Please share it :)

[@palashingle861]

Find the solution to the recurrence relation an =6an-1 +11an-2 -6an-3 with a0=2, a1=5 and a2=15.

[@alphaneracar7063]

I didn't quite understand the given equation at 11:45, in which you claim that a.n is equal to zero plus the sum as i goes from 1 to n of 2n. I think it should be 2i instead of 2n.

[@deepaskaria7410]

Thanks

[@k.alipardhan6957]

for the 10:00 mins mark, why isnt it something like: 2*i + X_(n-1). were i is the index, and X_(n-1) is the element before. did i just think of the recursive solution?

[@Selim_Hasan_Raj]

can you make a video on variation please?

[@aayushsrivastava9569]

I've learned more on KZbin than college

[@coffee1855]

thank you! two hours ago i was dying

[@wolfhart8269]

So with all those formulas. Which is the real formula for recurrence relation?

[@walasker6017]

what type of sequence is the one on 9:18 ?

[@ioannismarkoulakis4978]

is this the same as recursive ranks?

[@sukkuvaishnavi9387]

Sir can u explain again geometric progression

[@thexxmaster]

thanks

[@kankanampativenkatarao9767]

Nice

[@XXmuhnkeyXX]

The sum in 11:57 from i = 1 to n of n is NOT n(n+1)/2. This formula only works if you’re taking the sum of i, which is changing, whereas n is a constant with respect to i. Thus you can factor out the 2n like any constant and you’d really be taking the sum from i = 1 to n of 1, with the sum being multiplied by 2n after it is solved.

[@sietzevandervinne4208]

thanks strijder

[@joylox]

I'm doing stuff like this in discrete 1, but only solving them and giving the first few terms. This gets really confusing.

[@eenis1281]

How would you solve an=2a(n-1) - 3 this way?(a0 = -1) i get to: an-a0=-(4+8+16+32....2^(n+1)) but then am stuck

[@user-dj9iu2et3r]

Before the proof at the end... why did he use k as the variable in the summation when the index variable is i? shouldn't they match?

[@debjitkhaskel7879]

Does recurence relations has only one form

[@siyiroancreint]

Helps decipher the Wiki page, which says all this with 0 explanation. Thanks

[@sefaalperis7366]

Very good video but I think you made a mistake while writing the formula at 12:15 the k should be in front of the sum symbol and in the sum symbol there should be only i.

[@sj00100]

If a(n) = n, so a(n) = n(a(n) - a(n-1)), solving this give formula for sum of frst n natural numbers.

[@reynardryanda245]

YOU'RE A GOD

[@jono5658]

at least he explains why this time...

[@avesh_sayyed]

8:55 how have you done that then (Edited) probs should've seen the whole video sorry mate

[@jaideepshekhar4621]

7:18 But WHY are we adding all the terms?

[@onenicenero1494]

So most of the terms cancel out and we have only necessary part left. Simplification

[@juloguadalquiver3727]

I honestly say I didnt get it. You didnt explain specifically in 2:47 how to expand it and how 2an-1 actually works to find following sequence

[@semirumutkurt6635]

you made me remove my ad blocker