filmov
tv
Discrete Math II - 8.2.1 Solving First-Order Linear Homogeneous Recurrence Relations

Показать описание
We take another look at First-Order Linear Homogeneous Recurrence relations (and what exactly all of that means). We took our first look in section 8.1 by using back substitution and iteration. In this video we look at one example using both methods, then dive into further detail on how to model a geometric progression (not contained in your textbook).
Video Chapters:
Intro 0:00
What is a First-Order Linear Homogeneous Recurrence Relation 0:10
Solving a First-Order Recurrence Relation with Iteration and Back-Sub 2:31
Geometric Progressions and How to Model 6:30
Solving for a0 in a Geometric Progression 11:27
Up Next 14:24
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e
Power Point slide decks to accompany the videos can be found here:
The entire playlist can be found here:
Video Chapters:
Intro 0:00
What is a First-Order Linear Homogeneous Recurrence Relation 0:10
Solving a First-Order Recurrence Relation with Iteration and Back-Sub 2:31
Geometric Progressions and How to Model 6:30
Solving for a0 in a Geometric Progression 11:27
Up Next 14:24
This playlist uses Discrete Mathematics and Its Applications, Rosen 8e
Power Point slide decks to accompany the videos can be found here:
The entire playlist can be found here:
Discrete Math II - 8.2.1 Solving First-Order Linear Homogeneous Recurrence Relations
Discrete Math II - 8.1.1 Applications of Recurrence Relations
Composition of relations | MISTAKE - explained RoS instead of SoR and vice versa | otherwise correct
NEWYES Calculator VS Casio calculator
Discrete Math II - 5.2.1 Proof by Strong Induction
Discrete Math II - 8.2.2 Solving Second-Order Linear Homogeneous Recurrence Relations
Partitions of a Set | Set Theory
Introduction to Relations
LEC-1||SEMESTER-1|| DISCRETE MATHEMATICS & OPTIMIZATION TECHNIQUES || SESSION 2024-25
Discrete Math - 2.4.1 Introduction to Sequences
RELATIONS - DISCRETE MATHEMATICS
What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence
The Hardest Math Test
Countable and Uncountable Sets - Discrete Mathematics
Truth Table Tutorial - Discrete Mathematics Logic
When mathematicians get bored (ep1)
IIT Bombay Lecture Hall | IIT Bombay Motivation | #shorts #ytshorts #iit
Discrete Math II - 8.6.1 Apply the Principle of Inclusion-Exclusion: No Conditions Satisfied
Representation of Relations
Hasse Diagram
This chapter closes now, for the next one to begin. 🥂✨.#iitbombay #convocation
Solving congruences, 3 introductory examples
WGU Discrete Math 2 Tips and Tricks - C960 Passed in 3 Weeks!
Derangements | Discrete Mathematics | Engineering Mathematics
Комментарии