RECURRENCE RELATIONS - DISCRETE MATHEMATICS

[@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

[@newleafoverit]

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

[@clkinder1]

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

[@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 😊

[@brecoldyls]

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

[@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

[@snydex5064]

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

[@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.

[@DannyPhantumm]

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

[@swasthikadev]

12:19 isnt it summation Ki

[@alvinkatojr]

This is how mathematics should be taught! Brilliant!

[@patientson]

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

[@ushachandankar]

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

[@ChenukaGamage]

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

[@xaravox]

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

[@msrtrini]

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

[@braydenchan138]

Thank you, Tutor Trev!

[@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.

[@jon_tradez]

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

[@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.

[@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.

[@tgg3249]

Great video, great instructor.

[@陳翰儒-d5m]

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

[@Elantry]

These videos are seriously good! Wish I'd found them sooner.

[@equeschristi]

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

[@JamesBrodski]

Thank you so much! Great video.

[@Sspectator]

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.

[@Krimson-Crow]

I have an exam in an hour. Anyone else?

[@buntagkendrick887]

thank you man

[@bubblesgrappling736]

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

[@ayushmansrivastava3349]

Excellent video , crystall clear concepts.....

[@farisdurrani]

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

[@Noellexafael]

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

[@hubbankhan3309]

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

[@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

[@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?

[@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.

[@pjcamiam]

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.

[@glitchyplaysstuff1233]

helped me last minute back in highschool

[@gatos4840]

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

[@palashingle861]

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

[@hghlndr2]

good explanation to initial conditions

[@adiletbaimyrzauulu6589]

you helped me to get my degree sir

[@bartubozkurt7312]

this is fairly clear expression thank you

[@skullcrusade3436]

8:29, the moment everything exploded into my face. I was following along and then KABOOM sigma summation shit and now I'm scared. THank you fro the hlepufl ivode

[@SURaviKumarChavali]

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

[@FatihAlmutawakkil]

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

[@musficamurshidopshori2512]

Thank you so much for the discrete math tutorial!

[@bradleyshepard]

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

[@siyiroancreint]

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

[@Justinhoou]

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

[@lalith_kumar_akhila2411]

thanks for great explanation

[@walasker6017]

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

[@gcs4558]

which software are you using for this lecture

[@majdhaythem1462]

the best video ever on youtube !!

[@mikays3580]

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

[@Kamnuma]

Thank you so much! This video was helpful!

[@quirkyquester]

you are amazing! Thank you!

[@AynChat]

well,that was mind blowing

[@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?

[@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

[@RajeshKamboj]

Thank you so much sir.

[@simpleepic]

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

[@harshvirtomar6552]

You are awesome!!!

[@ioannismarkoulakis4978]

is this the same as recursive ranks?

[@josephmwanza5086]

well explained

[@mickey46911]

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

[@HeatherHolt]

Thank you ❤

[@catherinezhang8334]

good video! great explanations!

[@sextolife]

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

[@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?

[@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.

[@sietzevandervinne4208]

thanks strijder

[@crowlsyung]

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

[@wolfhart8269]

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

[@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.

[@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 :)

[@calpherabw7471]

thank you

[@thexxmaster]

thanks

[@debjitkhaskel7879]

Does recurence relations has only one form

[@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

[@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

[@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.

[@AhamedKabeer-wn1jb]

Superb...

[@kgkcStudios]

Out here doing God's work

[@aayushsrivastava9569]

I've learned more on KZbin than college

[@yujiabing8820]

so clear/ thx

[@reynardryanda245]

YOU'RE A GOD

[@JJScene]

7:32 You don't explain why you're adding them up, or how on earth a1 - a0 + a2 - a1 is equal to a1 - a1.

[@semirumutkurt6635]

you made me remove my ad blocker

[@nishithamathew6289]

useful video

[@Selim_Hasan_Raj]

can you make a video on variation please?

[@sukkuvaishnavi9387]

Sir can u explain again geometric progression

[@coffee1855]

thank you! two hours ago i was dying

[@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)

[@joylox]

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