Group 2:

FUNCTIONS
MEMBERS:
DI1
Emmanuel Ampatin
Reo John Andohuyan
Prince Niño Antigo
Stanley James Apal
Cristel Marie Arisobal
Buena Rose Arro

DJ1

Michelle Borromeo
Tyron Reid Brasileno
Ivan Christopher Braza
Jiecyn Bucong
Eden Grace Bughao
Althea Loraine Buna
 Search
Function
All Images Videos
Search Functions
All Images Videos

Functions

Types of Functions

Identity Functions

Compositions of Functions

Mathematical Functions
 Search Functions
Functions

Is a mapping in which every element of set A is uniquely associated at the element with set B.
The set of A is called Domain of a function while the set of B is called a Co-domain.

Domain of a Function – Let f be a function from P to Q. The set P is called the domain of
the function f.

Co-domain of a Function – Let f be function from P to Q. The set Q is called Co-domain

of the function f.

Range of Function – The range of a function is the set of picture of its domain. In other
words, we can say it is a subset of its co-domain. It is denoted as f (domain).
 Search Functions
Functions
Example: Find the Domain, Co-Domain, and Range of function.

Let x = { 1, 2, 3, 4}
y = { a, b, c, d, e}
f = {( 1, b), ( 2, a), ( 3, d), (4, c)}

Solution:

Domain of function: { 1, 2, 3, 4 }

Range of function: { a, b, c, d }

Co-Domain of function: { a, b, c, d, e }
 Search Functions
Functions as a set
If P and Q are two non-empty sets, then a function f from P to Q is a subset of P x Q, with two important restrictions

1. ∀ a ∈ P, (a, b) ∈ f for some b ∈ Q

2. If (a, b) ∈ f and (a, c) ∈ f then b = c.

NOTE:
1. There are some elements of the Q which are not related to any element of set P.
2. Every element of P must be related with at least one element of Q.

Example: If a set A has n elements, how many functions are there from A to A?
Solution: If a set A has n elements, then there are nn functions from A to A.
 Search Functions
Representation of a Function
The two sets P and Q are represented by two circles. The function f: P Q is represented by a collection of arrows joining
the points which represent the elements of P and corresponds elements of Q.

Example:

1. Let X = { a, b, c } and Y = { x, y, z} and f: X Y such that f = {(a, x), (b, z), (c, x)
F can be represented diagrammatically as:
 Search Functions
Representation of a Function
2. Let X = { x, y, z, k } and Y = { 1, 2, 3, 4 }. Determine which of the following is a function. Give reasons if it is not a
function.
Find range if it is a function.

a. f = {(x, 1), (y, 2), (z, 3), (k, 4)}

b. g = {(x, 1), (y, 2), (k, 4)}

Solution:

c. It is a function. Range (f) = { 1, 2, 3, 4}

d. It is not a function because every element of X does not relate with some element of Y i.e., Z is not related with any
element of Y.
Click to go back
 Search Types of Functions
1. Injective (One-to-One) Functions: A function in which one element of Domain Set is connected to one element of Co-
Domain Set.

Example:

2. Surjective (Onto) Functions: A function in which every element of Co-Domain Set has one pre-image.

Example: Consider, A = {1, 2, 3, 4}, B = {a, b, c} and f = {(1, b), (2, a), (3, c), (4, c)}
It is a Surjective Function, as every element of B is the image of some A

Note: In an Onto Function, Range is equal to Co-Domain.

 Search Types of Functions
3. Bijective (One-to-One Onto) Functions: A function which is both injective (one-to-one) and surjective (onto) is called
bijective (One-to-One Onto) Function
Example:

4. Into Functions: A function in which there must be an element of co-domain Y that does not have a pre-image in
domain X.
Example: Consider, A = {a, b, c}, B = {1, 2, 3, 4} and f = {(a, 1), (b, 2), (c, 3)}
In the function f, the range i.e., {1, 2, 3}  ≠ co-domain of Y i.e., {1, 2, 3, 4}
 Search Types of Functions
5. One-One Into Functions: Let f: X Y. The function f is called one-one into function if different elements of X have
different unique images of Y.
Example: Consider, X = {k, l, m} Y = {1, 2, 3, 4} and f: X Y such that f = {(k, 1), (l, 2), (m, 4)}

6. Many-One Functions: Let f: X Y. The function f is said to be many-one functions if there exists two or more than two
different elements in X having the same image in Y.
Example: Consider, X = {1, 2, 3, 4, 5} Y = {x, y, z} and f: X Y such that f = {(1, x), (2, x), (3, x), (4, y), (5, z)}
 Search Types of Functions
7. Many-One Into Functions: Let f: X Y. The function f is called the many-one into function if and only if it is both many
one and into function.
Example: Consider, X = {a, b, c} Y = {1, 2} and f: X Y such that f = {(a, 1), (b, 1), (c, 1)}

8. Many-One Onto Functions: Let f: X Y. The function f is called many-one onto function if and only if it is both many
one and onto.
Example: Consider, X = {1, 2, 3, 4} Y = {k, l} and f: X Y such that f = {(1, k), (2, k), (3, l), (4, l)}

Click to go back
 Search Identity Functions

Identity Functions
The function f is called the identity function if each element of set A has an image on itself i.e. f (a) = a ∀ a ∈ A.

It is denoted by I.

Example: Consider, A = {1, 2, 3, 4, 5} and f: A A such that f = {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)}.
 Search Invertible (Inverse) Function

Invertible (Inverse) Functions

A function f: X → Y is invertible if and only if it is a bijective function.

Consider the bijective (one to one onto) function f: X → Y. As f is a one to one, therefore, each element
of X corresponds to a distinct element of Y. As f is onto, there is no element of Y which is not the image
of any element of X, i.e., range = co-domain Y.

The inverse function for f exists if f-1 is a function from Y to X.

 Search Example of Inverse Function
Example:

Consider, X = {1, 2, 3}
Y = {k, l, m} and f: X Y such that f = {(1, k), (2, m), (3, l)}.

The inverse function of f:

Click to go back
 Search Composition of Functions
Composition of Functions
Consider functions, f: A → B and g: B → C. The composition of f with g is a function from A into C defined by
(gof) (x) = g [f(x)] and is defined by gof.
      To find the composition of f and g, first find the image of x under f and then find the image of f (x) under g.

Example 1: Let X = {1, 2, 3} Y = {a, b} Z = {5, 6, 7}

Consider the function f = {(1, a), (2, a), (3, b)} and g = {(a, 5), (b, 7)} as in figure. Find the composition of gof.

Solution:
(gof) (1) = g [f (1)] = g (a) =
5
(gof) (2) = g [f (2)] = g (a) =
5

(gof) (3) = g [f (3) = g (b) = 7

 Search Composition of Functions
Example 2:
Consider f, g and h, all functions on the integers, by f (n) = n 2 , g (n) = n + 1 and h (n) = n – 1.

Determine (i) hofog (ii) gofoh (iii) fogoh

Solution:
(i) hofog (n) = n + 1,
hofog (n + 1)= (n + 1)2
h [ (n + 1)2 ]= (n + 1)2 – 1
= n2 + 1 + 2n – 1
= n2 + 2n.
(ii) gofoh (n) =n – 1
gof (n-1) =(n-1)2
g[(n - 1)2] =(n - 1)2 + 1
= n2 + 1 – 2n + 1
= n2 – 2n + 2.

(iii) fogoh (n) = n – 1

fog (n – 1) = (n – 1) + 1
f (n) = n2
Note:
• If f and g are one-to-one, then the function (gof) (gof) is also one-to-one.
• If f and g are onto then the function (gof) (gof) is also onto.
Click to go back
• Composition consistently holds associative property but does not hold commutative property.
 Search Mathematical Functions
The following are the functions which are widely used in computer science.

1. Floor Functions: The floor function for any real number x is defined as f (x) is the greatest integer 1 less than or equal to x.
It is denoted by [x].
Example: Determine the value of

(i) [3.5] (ii) [-2.4] (iii) [3.143]

Solution:

(i) [3.5] = 3 (ii) [-2.4] = -3 (iii) [3.143] = 3

2. Ceiling Functions: The ceiling function for any real number x is defined as h (x) is the smallest integer greater than or equal
to x. It is denoted by [x].
Example: Determine the value of

(i) [3. 5] (ii) [-2.4] (iii) [3.143]

Solution:

(i) [3.5] = 4 (ii) [-2.4] = -2 (iii) [3.143] = 4

 Search Mathematical Functions
3. Remainder Functions: The integer remainder is obtained when some a is divided by m. It is denoted by a (MOD m).
We can also define it as, a (MOD m) is the unique integer t such that a = Mq + t. Here q is quotient 0 ≤ r < M.
Example: Determine the value of the following:
(i) 35 (MOD 7) (ii) 20 (MOD 3) (iii) 4 (MOD 9)
Solution:
(i) 35 (MOD 7) = 0 (ii) 20 (MOD 3) = 2 (iii) 4 (MOD 9) = 4

4. Exponential Functions: Consider two sets A and B. Let A = B = I+ and also let f: A → B be defined by f (n) = kn.
Here n is a negative integer. The function f is called the base k exponential function.

(i) 103 (ii) 51/2 (iii) 3-5

Solution:

(iii) f(-5) = 3-5

(i) f(3) = 103
= 10. 10. 10 =
= 1000 =

(ii) F(1/2) = 51/2

=
= 2.23607
 Search Mathematical Functions
5. Logarithmic Functions: Consider two sets A and B. Let A = B = R (the set of real numbers and also let f_n:A→B be defined
for each positive integer n > 1 as fn (x)=logn(x) the base n of x.

Note:
1. k = logn x and are equivalent.

2. For any base n, logn 1 = 0 as

3. For any base n, logn n = 1 as

Example:

(i) log2 16 (ii) log2 100 (iii) log2 0.001

Solution:

(i) log2 16 = 4 as
log2 16
2?=16 =16
2*2*2*2=16
=16
Click to go back
Search Mathematical Functions

(ii) log2 100 = 6 as = 64 but = 128 which is greater

log2 100

= 64

= 128

26.64385618977 = 100

(iii) log2 0.001 = -9 as = but = which is greater

log2 0.001

2-9.96578428466 = 0.001

Click to go back
Search Functions Video
All Videos Images

FUNCTIONS – DISCRETE MATHEMATICS

INJECTIVE, SURJECTIVE, and BIJECTIVE FUNCTIONS – DISCRETE MATHEMATICS

 Function-Discrete Mathematics

INJECTIVE, SURJECTIVE
, and BIJECTIVE FUNCTI
ONS -…

FUNCTIONS – DISCRETE MATHEMATICS

 Injective, Surjective, and Bijective Functions

INJECTIVE,
SURJECTIVE, and
BIJECTIVE FUNCTIONS -
…

INJECTIVE, SURJECTIVE, and BIJECTIVE FUNCTIONS – Discrete Mathematics

Thank you for
listening!