Discrete Math I (Entire Course) - Discrete Math - 8.1.1 Modeling with 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
Modeling some of the famous combinatoric questions (Tower of Hanoi, Fibonacci) with recurrence relations.
Video Chapters:
Introduction 0:00
Recurrence Relations 0:06
Recurrence Relation to Explicit Function 2:36
Fibonacci 5:37
Tower of Hanoi 11:43
Bit Strings 19:32
Up Next 25:23
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.
