Welcome to Every Other Odd! I'm your guide on this journey through the captivating world of Discrete Mathematics. On this channel, I tackle every other odd-numbered problem, breaking down complex concepts into manageable steps. Whether you're a student looking to deepen your understanding, a teacher seeking fresh insights, or just a math enthusiast, you'll find my videos both enlightening and engaging. I believe in making math accessible to everyone, and I'm committed to helping you unravel its mysteries. Join me as we explore the fascinating landscape of Discrete Mathematics together, one problem at a time. Let's discover the beauty of math!

(5.7.49) Proving the Explicit Formula for a Recursively Defined Sequence Using Strong Induction
14:35
(5.7.49) Proving the Explicit Formula for a Recursively Defined Sequence Using Strong Induction
(5.7.45) Proving an Explicit Formula for a Recursively Defined Sequence Using Strong Induction
16:35
(5.7.45) Proving an Explicit Formula for a Recursively Defined Sequence Using Strong Induction
(5.7.41) Verifying the Explicit Formula for the Recursive Sequence Using Mathematical Induction
3:45
(5.7.41) Verifying the Explicit Formula for the Recursive Sequence Using Mathematical Induction
(5.7.37) Mathematical Induction Verification of Recurrence Relation for Sequence S_n
3:34
(5.7.37) Mathematical Induction Verification of Recurrence Relation for Sequence S_n
(5.7.33) Proving the Formula for a Recursive Sequence Using Mathematical Induction
4:14
(5.7.33) Proving the Formula for a Recursive Sequence Using Mathematical Induction
(5.7.29) Verifying Recursive Formula Using Mathematical Induction
3:38
(5.7.29) Verifying Recursive Formula Using Mathematical Induction
(5.7.25) Understanding the Growth of a Computer Algorithm through Geometric Sequences
1:53
(5.7.25) Understanding the Growth of a Computer Algorithm through Geometric Sequences
(5.7.21) Proving a Recursive Sequence's Formula Using Mathematical Induction
4:06
(5.7.21) Proving a Recursive Sequence's Formula Using Mathematical Induction
(5.7.17) Solving a Recurrence Relation Using Iteration to Derive an Explicit Formula
4:02
(5.7.17) Solving a Recurrence Relation Using Iteration to Derive an Explicit Formula
(5.7.13) Deriving an Explicit Formula for a Recursively Defined Sequence
4:09
(5.7.13) Deriving an Explicit Formula for a Recursively Defined Sequence
(5.7.9) Finding an Explicit Formula for a Recursively Defined Sequence Using Iteration
5:51
(5.7.9) Finding an Explicit Formula for a Recursively Defined Sequence Using Iteration
(5.7.5) Finding an Explicit Formula for a Recursively Defined Sequence Using Iteration
5:03
(5.7.5) Finding an Explicit Formula for a Recursively Defined Sequence Using Iteration
(5.7.1) Proving the Formula for the Sum of Consecutive Integers and Its Applications
4:34
(5.7.1) Proving the Formula for the Sum of Consecutive Integers and Its Applications
(5.6.45) Proving Any Sum of Even Integers is Even Using Mathematical Induction
3:19
(5.6.45) Proving Any Sum of Even Integers is Even Using Mathematical Induction
(5.6.41) Proving the Generalized Distributive Law Using Mathematical Induction
8:50
(5.6.41) Proving the Generalized Distributive Law Using Mathematical Induction
(5.6.37) Understanding Compound Interest: Recurrence Relations and APY Calculation
3:25
(5.6.37) Understanding Compound Interest: Recurrence Relations and APY Calculation
(5.6.33) Verifying the Fibonacci Sequence's Explicit Formula and Recurrence Relation
5:44
(5.6.33) Verifying the Fibonacci Sequence's Explicit Formula and Recurrence Relation
(5.6.29) Proving the Fibonacci Identity F_k+1^2 - F_k^2 = F_k-1 * F_k+2
2:00
(5.6.29) Proving the Fibonacci Identity F_k+1^2 - F_k^2 = F_k-1 * F_k+2
(5.6.25) Verifying the Explicit Formula of the Fibonacci Sequence Satisfies the Recurrence Relation
3:43
(5.6.25) Verifying the Explicit Formula of the Fibonacci Sequence Satisfies the Recurrence Relation
(5.6.13) Proving a Recursive Relation for the Sequence Defined by T_n = 2 + n
4:03
(5.6.13) Proving a Recursive Relation for the Sequence Defined by T_n = 2 + n
(5.6.9) Proving the Recurrence Relation of a Sequence Using an Explicit Formula
2:15
(5.6.9) Proving the Recurrence Relation of a Sequence Using an Explicit Formula
(5.6.5) Finding the First Four Terms of a Recursively Defined Sequence
1:34
(5.6.5) Finding the First Four Terms of a Recursively Defined Sequence
(5.6.1) Finding the First Four Terms of Recursively Defined Sequences
2:10
(5.6.1) Finding the First Four Terms of Recursively Defined Sequences
(5.5.5) Proving a Predicate Holds True After Exiting a While Loop
2:52
(5.5.5) Proving a Predicate Holds True After Exiting a While Loop
(5.5.1) Proving Predicate Preservation in While Loops Through Iteration Analysis
5:25
(5.5.1) Proving Predicate Preservation in While Loops Through Iteration Analysis
(5.4.33) Proving Ordinary Mathematical Induction Using Strong Mathematical Induction
5:06
(5.4.33) Proving Ordinary Mathematical Induction Using Strong Mathematical Induction
(5.4.29) Proving Integer Bounds on Rational Numbers Using Well-Ordering Principle & Archimedean Prop
15:14
(5.4.29) Proving Integer Bounds on Rational Numbers Using Well-Ordering Principle & Archimedean Prop
(5.4.25) Flawed Mathematical Induction Proof That All Powers of Nonzero Real Numbers Equal 1
11:41
(5.4.25) Flawed Mathematical Induction Proof That All Powers of Nonzero Real Numbers Equal 1
(5.4.21) Strong Induction Proof of Recursive Sequence Using Floor and Ceiling Functions
18:28
(5.4.21) Strong Induction Proof of Recursive Sequence Using Floor and Ceiling Functions
(5.4.17) Units Digit Pattern in Powers of 4 - Proving a Conjecture w/ Strong Mathematical Induction
7:57
(5.4.17) Units Digit Pattern in Powers of 4 - Proving a Conjecture w/ Strong Mathematical Induction