Discrete Math I (Entire Course) - Discrete Math - 2.4.2 Recurrence Relations
Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!
5.0(2)
18 learners
What you'll learn
Understand and apply logical operations and connectives in propositions.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.
This course includes
18.5 hours of video
Certificate of completion
Access on mobile and TV
Summary
Full Transcript
What is a recurrence relation, and how can we write it as a closed function?
Video Chapters:
Introduction 0:00
Recurrence Relation Defined and Example 1 0:04
Examples 2 and 3 4:15
Fibonacci Sequence 8:01
Solving Recurrence Relations 9:38
Solving a Recurrence Relation Using Iteration 10:34
Using Iteration Without Substitution 12:59
Up Next 15:01
Textbook: Rosen, Discrete Mathematics and Its Applications, 7e
Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
