Here we look at the "Towers of Hanoi" problem, which involves using recursion twice. We have to move n cylinders of different sizes from one peg to another, utilizing a third one if necessary, and such that no "bigger" cylinder is on top of a smaller cylinder at any point. What we can do is to define inductive cases really easily, and then solve the whole problem by just relating the two recursive "moves" of n-1 cylinders to each other.<br /><br />An example worked out is here: <a href="https://www.youtube.com/watch?v=svjqkfdhIQI" target="_blank" rel="nofollow">https://www.youtube.com/watch?v=svjqkfdhIQI</a><br /><br />#easytheory #gate #theory<br /><br />Contribute:<br />Donation (appears on streams): <a href="https://streamlabs.com/easytheory1/tip" target="_blank" rel="nofollow">https://streamlabs.com/easytheory1/tip</a><br />Paypal: <a href="https://paypal.me/easytheory" target="_blank" rel="nofollow">https://paypal.me/easytheory</a><br />Patreon: <a href="https://www.patreon.com/easytheory" target="_blank" rel="nofollow">https://www.patreon.com/easytheory</a><br />Discord: <a href="https://discord.gg/SD4U3hs" target="_blank" rel="nofollow">https://discord.gg/SD4U3hs</a><br /><br />Youtube Live Streaming (Sundays) - subscribe for when these occur.<br /><br />Social Media:<br />Facebook Page: <a href="https://www.facebook.com/easytheory/" target="_blank" rel="nofollow">https://www.facebook.com/easytheory/</a><br />Facebook group: <a href="https://www.facebook.com/groups/easytheory/" target="_blank" rel="nofollow">https://www.facebook.com/groups/easytheory/</a><br />Twitter: <a href="https://twitter.com/EasyTheory" target="_blank" rel="nofollow">https://twitter.com/EasyTheory</a><br /><br />Merch:<br />Language Hierarchy Apparel: <a href="https://teespring.com/language-hierarchy?pid=2&cid=2122" target="_blank" rel="nofollow">https://teespring.com/language-hierarchy?pid=2&cid=2122</a><br />Pumping Lemma Apparel: <a href="https://teespring.com/pumping-lemma-for-regular-lang" target="_blank" rel="nofollow">https://teespring.com/pumping-lemma-for-regular-lang</a><br /><br />If you like this content, please consider subscribing to my channel: <a href="https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1" target="_blank" rel="nofollow">https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1</a><br /><br />Gold Supporters: Micah Wood<br />Silver Supporters: Timmy Gy<br /><br />▶SEND ME THEORY QUESTIONS◀<br />[email protected]<br /><br />▶ABOUT ME◀<br />I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.<br />...<br /><a href="https://www.youtube.com/watch?v=Hd0EekdmpKA" target="_blank" rel="nofollow">https://www.youtube.com/watch?v=Hd0EekdmpKA</a>