Recursively Defined Functions - Discrete Mathematics - Lecture Slides, Slides for Discrete Mathematics. Islamic University of Science & Technology

Discrete Mathematics

Description: During the study of discrete mathematics, I found this course very informative and applicable.The main points in these lecture slides are:Recursively Defined Functions, Recursive Step, Fibonacci Sequence, Positive Integer, Recursively Defined Sets, Recursively Defined Languages, Recursively Defined Structures, Binary Trees, Fibonacci Proof, Inductive Proof Process
Showing pages  1  -  2  of  7
Discrete Mathematics
CS 2610
October 21, 2008
Docsity.com
2
Recursively Defined Functions
We are familiar with the use of formulae to define
functions. But it is also possible to define some
functions using recursion.
Example:
f(n) = n2 for n Z≥0
or…
f(0) = 0
f(n+1) = f(n) + (2n + 1), for n Z≥0
Docsity.com
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome