Scribd
Upload
16 views2 pages

Understanding Recursion in Mathematics

Recursion is a concept where an object is defined in terms of itself, commonly found in mathematics and daily life. Examples include natural numbers, tree structures, and the factorial function, showcasing how finite statements can define infinite sets. The document also outlines a structure diagram for software, categorizing it into application and system software, along with various types of programs.

Uploaded by

kevinadiso507
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

Understanding Recursion in Mathematics

Recursion is a concept where an object is defined in terms of itself, commonly found in mathematics and daily life. Examples include natural numbers, tree structures, and the factorial function, showcasing how finite statements can define infinite sets. The document also outlines a structure diagram for software, categorizing it into application and system software, along with various types of programs.

Uploaded by

kevinadiso507
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Leaning word

RECURSION
An object is said to be recursive if it partially consists (or is defined in terms) of itself.
Recursion is encountered not only in mathematics, but also in daily life. Who hasn’t seen an
advertising picture which contains itself?

Recursion is a particularly powerful means in mathematical definitions. A few familiar


examples are those of natural numbers, tree structures and of certain functions.

(a). Natural numbers


(i). 1 is a natural number.

(ii). the successor of a natural number is a natural number.

(b). Tree structures, e.g., O is a tree (called the empty tree).


(c). The factorial function n! (for non-negative integers).
(i). 0! =1.
(ii). If n > 0, then n! = n.(n - 1)!.

The power of recursion evidently explicit repetitions. Recursive


lies in the possibility of defining algorithms however are primarily
an infinite set of objects by a appropriate when the problem to
finite statement. In the same be solved or the function to be
manner, an infinite number of computed or the data structure to
computations can be described be processed is already defined in
by a finite recursive program, recursive terms.
even if this program contains no

STRUCTURE DIAGRAM

SOFTWARE

APPLICATION SYSTEM
SOFTWARE SOFTWARE

User Standard Operating Utility Translators


Developed packages Systems programs

The above structure describes the software breakdown. The information can also be
presented using a table as shown below:

©KEVIN
Leaning word

Translators
System software Utility programs
Software
Operating systems
Application software User developed
Standard packages

©KEVIN

You might also like