RECURRENCE RELATIONS - DISCRETE MATHEMATICS

Learning discrete mathematics makes me want to leave everything behind and go live in the woods.

im gonna bang my head against a wall

thank you man

Hey hope you are doing alright just I wanna say that
GOD loved the world so much he sent his only begotten
son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD.....

Thanks

Maybe I am stupid ! I don't get anything ☺️☺️☺️☺️

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

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

Thank you so much! Great video.

you helped me to get my degree sir

Great video, great instructor.

They wanted us to solve a function problem through this... WTF

What's up with the 666!!!

I have an exam in an hour. Anyone else?

thank you

Thank you, Tutor Trev!

thanks strijder

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

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?

thanks for great explanation

thank you! two hours ago i was dying

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

helped me last minute back in highschool

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

this wasn't helpful at all.

Dolbaeb dyrystap tusindirmeisin ba
aUildyn kara maimili

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

well explained

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

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

Am sorry what are you talking about mr-

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

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

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

Solve the recurrence relation:
𝑎𝑛 = 8𝑎𝑛−1 − 21𝑎𝑛−2 + 18𝑎𝑛−3, 𝑎0 = 5, 𝑎1 = 2, 𝑎2 = 13
?

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

Why do you have to use 666?

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?

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 😊

lol you just haddd to use 666

can you make a video on variation please?

this is fairly clear expression thank you