This is the first video in the "Discrete Mathematics" series. We will cover how to create a recursive formula for the Tower of Hanoi issue. After we've found it, I'll show how to find a closed formula and proof it with the help of induction.

⏰ Timeline
00:00 Explanations
00:40 Finding recursive formula
05:46 Creating closed formula
07:39 Proof by induction

🔢 Recursive formula
T(n) = 2 * T(n) + 1
T(1) = 1

🔢 Closed formula
T(n) = 2^n - 1

📜 All Discrete Mathematics Exercises
   • Discrete Mathematics Exercises  

📜 All Linear Algebra Exercises
   • Linear Algebra Exercises  

🖼️ Thumbnail icon credits
Pyramid icon made by Freepik from www.flaticon.com