ECS20 - W22 - Lecture 13 (7T): Induction and Recursion 2

From Phil Rogaway February 16, 2022

114 plays 0 comments You unliked the media.

Lecture 2022-02-15. A proof by strong induction: the Fundamental Theorem of Arithmetic. Induction on a definition: boolean formulas have the same number of left and right parentheses. Recursion as a problem-solving technique. Counting the number of tic-tac-toe games. The Towers of Hanoi problem.

Tags: inductionparenthesesprimesformularingsalgorithmpegsymbolstic-tac-toetowers of hanoifundamental theorem of arithmetic

Appears In: Colleges Computer Science

Comments
Related Media

Loading…

ECS20 - W22 - Lecture 13 (7T): Induction and Recursion 2

Related Media