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

##### Document information

Uploaded by:
atasi

Views: 1305

Downloads :
0

Address:
Mathematics

University:
Islamic University of Science & Technology

Subject:
Discrete Mathematics

Upload date:
27/04/2013