DMMR: Study guide for Chapter 5 of the textbook by K. Rosen
Key concepts. (This is not a complete list of the course content.)
Mathematical induction and proofs by induction;
See in particular the Template for Proofs by Mathematical Induction
at the end of Subsection 5.1
Strong Induction and Well Ordering
Very basic recursive algorithms, e.g., factorial and gcd.
Parts of chapter 5 not covered in this course
Strong induction in computational geometry; structural induction;
Lamé's Theorem; subsection 5.5. (program correctness).
|Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail:
Please contact our webadmin with
any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright ©
The University of Edinburgh