Professional Documents
Culture Documents
Unit2 2020 FinalmoduleforITMS-01 Withwatermark
Unit2 2020 FinalmoduleforITMS-01 Withwatermark
Overview
Learning Objectives
Setting Up
Have you ever wondered how numbers arranged in sequence can represent patterns in
nature?
Lesson Proper
Recursion
The terms of a recursive sequence can be numbers, graphs and other objects.
26
ITMS-01 Discrete Structures
whenever .
Example
27
ITMS-01 Discrete Structures
whenever .
Example
{ }.
{ }.
28
ITMS-01 Discrete Structures
whenever .
Example
{ }.
{ }.
29
ITMS-01 Discrete Structures
The BERNOULLI numbers were named after its creator Jakob Bernoulli.
The initial value of the Bernoulli numbers is and the recursion of the
sequence of numbers is
( ) ( ) ( )
When , then
( ) ( )
When , then
( ) ( ) ( )
When , then
( ) ( ) ( ) ( )
30
ITMS-01 Discrete Structures
Example
When , then
(We can also refer to the figure above and get the equation in the second row.)
( )
( )
( )
( )
( )
31
ITMS-01 Discrete Structures
( ) ( )
( ) ( )
( ) ( )
( )
( )
( )
( )
32
ITMS-01 Discrete Structures
The Collatz sequence was created by the German mathematician named Lothar
Collatz. It is also known as the sequence.
We need to first assume a positive integer for the initial value denoted by
Then the Collatz sequence is recursively defined by:
{ }
Note that computing terms will stop whenever the value of is reached.
Example
Solution:
, odd
, even
, even
, even
, even
, STOP!!!
33
ITMS-01 Discrete Structures
Example
Solution:
, odd
, even
, even
, even
, odd
, even
, even
, even
, even
, STOP!!!
But there is one question we must address before we can move further with the Collatz
sequence, and that is;
“Does the Collatz sequence always reach 1 after a finite number of steps?”
We need to set a positive integer for the initial value . Then we can solve for the
succeeding numbers of the sequence recursively defined by:
{ }
34
ITMS-01 Discrete Structures
Example
Let’s take .
Solution:
, odd
, even
, odd
, even
, even
even
, even
, even
, odd
, even
The sequence will repeat itself on the 10th term, thus the Collatz sequence is:
{ }.
35
ITMS-01 Discrete Structures
References
http://www.math.northwestern.edu
Cruz, Rebecca J. and Tandingan, Glenda R., Simplified Discrete Mathematics, 2012 Edition.
Ymas, Sergio Jr E., Lopez, Joseph P., DISCRETE MATHEMATICS, 2009 Edition.
36
ITMS-01 Discrete Structures
Assessing Learning
Activity 1
Name: __________________________________________________ Score: ________________
Course/Year/Section: _______________________________ Date: _________________
37
ITMS-01 Discrete Structures
Activity 2
Name: __________________________________________________ Score: ________________
Course/Year/Section: _______________________________ Date: _________________
38
ITMS-01 Discrete Structures
Activity 3
Name: __________________________________________________ Score: ________________
Course/Year/Section: _______________________________ Date: _________________
39
ITMS-01 Discrete Structures
Activity 4
Name: __________________________________________________ Score: ________________
Course/Year/Section: _______________________________ Date: _________________
40
ITMS-01 Discrete Structures
41
ITMS-01 Discrete Structures
Activity 5
Name: __________________________________________________ Score: ________________
Course/Year/Section: _______________________________ Date: _________________
42
ITMS-01 Discrete Structures
43