KENYATTA UNIVERSITY

DEPARTMENT OF COMPUTING AND INFORMATION

TECHNOLOGY

SIT 404: MANAGEMENT MATHEMATICS

Lecture Notes

By: Mr. Ojwang D.O.

1
 COURSE OUTLINE 1/2
• Set Theory:
– Definition, Basic Concepts of Set Theory ,subsets, power sets,
simple examples, Operations on sets; union, intersection and
complement
– De Mo ga s La s. Elementary Logic; universal and existential
ualifie s. P oof o t adi tio a d induction
• Equations and Inequalities:
– Methods of proof for inequalities. Solution of inequalities
containing unknown variables
– Linear inequalities with one or two variables, systems of liner
inequalities with two variables. Some simple problems of linear
optimization.
– Quadratic inequalities with one variable.

2
 COURSE OUTLINE 2/2
• Functions, Limits and Continuity:
– Functions and their graphs; linear and quadratic functions; the algebra of
functions; solving equations (including factoring and the quadratic formula);
– Exponents and power functions; graphing functions, with special attention to
the graphs of straight lines; applications of functions and their graphs; and,
the slope of a straight line.
• Differential Calculus and Integral of Functions :
– The definition of the derivative and related topics (limits and continuity);
techniques of differentiation; applications of the derivative to rates of change,
curve sketching, and optimization; exponential and logarithmic functions and
their derivatives;
– Applications of exponential and logarithmic functions; and, integration.
– An introduction to multivariable functions; level curves;
– Finding partial derivatives, including second-order and mixed partial
derivatives; interpretation of a partial derivative as a rate of change; relative
extrema of functions of two variables
• Mathematics of Finance:
– Simple interest; Compound interest; Future value of annuity; Sinking funds;
Present value of an annuity; Amortization 3
• Course Delivery Methodology
– Lectures will be used to introduce material on the
formal aspects of the unit
– Discussions and working out problems

• Assessment
– Examination: 70%
– CATs: 30%
• 20% CAT
• 10% Assignments,
– Total: 100%

4
 Set Theory
Sets: Basic definitions
• A set is any collection of objects, for example, set of
numbers, rivers in Kenya, vowels of alphabets, soldiers in a
battalion, etc.
• The objects of a set are called the elements of the set.
• A set can be defined as a collection of objects which are
called the members or elements of that set.
• If we have a set we say that some objects belong (or do not
belong) to this set.
• A set may be specified by listing its elements. For example,
{1, 3, 6} denotes the set with elements 1, 3 and 6. This is
called the list form for the set. Note the curly brackets.
• We usually use capital letters A, B, C, etc., to denote sets
5
• The notation x  A means is an element of
A
• But the otatio  A ea s is not an
element of A".

1 {1, 2,4} , 2  {1,2,3} but 3 {1,2,4}.

EXAMPLE:

6
 SET THEORITIC RELATIONS
EQUALITY:
– The set that has no elements is called an empty set
– Two sets are said to equal iff they have the same elements. Thus
if A and B are empty sets then we have A = B
SUBSETS:
Consider the sets A and B where A = { 2,4 } and B = { 1,2,3,4,5 }

We say A is a subset of B ( A  B ) or (B  A).

Note: Every element of set A is an element of the set B.

That is B contains A or A is included in B

A is a subset of B if and only if every element of A is an

written as A  B to denote this

element of B
If A ⊆ B and A ≠ B then we call A a proper subset of B and is

7
• The Venn diagram illustrates the relationship
between A and B. This relationship also exists
between the U and B and U and A. In other
words, A ⊆ U and B ⊆ U.

U B The set U is
A the universe
set

8
• Universal set: Sometimes called the universe
set is the set of all items under considerations
for a particular problem.
A rectangle is often used to represent the
universal set.
Example: The example in the next slide is based
on characters in the Harry Potters book.

9
 B
A U
Fleur Ginny Charlie
Arthur Fred
Molly Percy
George
C
Bill Ron
Errol
Pigwidgeon Hermes
The ghoul
Arnold

10
U = {Arthur, Molly, Fleur, Ginny, Charlie, Fred, Percy,
George, Bill, Ron, Errol, Pigwidgeon, Hermes,
Arnold, The ghoul}

A = { x ∈ U | x is a Weasley parent }
= {Arthur, Molly}
B = { x ∈ U | x is a Weasley child }
= {Ginny, Ron, Charlie, Fred, George, Bill, Percy}
C = { x ∈ U | x is a Weasley pet }
= {Errol, Pigwidgeon, Arnold, Hermes}
11
Union:
It takes two sets and unites the elements into a
comprehensive set.
The union of the set A and the set B is the set that
contains all the elements that belong to A or to B, written
as A ∪ B.
Example:
Let E = {Ron, Fred, George} and
let F = {Ron, Harry, Hermione}
Then
E ∪ F = {Ron, Fred, George, Harry, Hermione}

12
E F U

The shaded area represents E U F

13
Intersection:
The intersection of the set A and the set B is the
set that contains all the elements that belong to
both A a d B, itte A ∩ B.
Fo e a ple E ∩ F = { ‘o } ep ese ted as

14
E F U

The shaded a ea ep ese ts E ∩ F

15
Complementation:
The idea behind this operation is that it
subtracts the elements of one set from another.

The difference between the set E and the set F is

the set that contains all the elements that
belong to E but not to F
Represented as:
16
E F U

The shaded area represents E - F

17
The difference U – A has a special name. This set
is called the complement of A. It contains those
elements in the universe set U that are not in A.
It is written A' .

Let U = {Ron, Fred, George, Harry, Hermione,

Lupin, Sirius}
E = {Ron, Fred, George}
Then E' = U – E = {Harry, Hermione, Lupin, Sirius}
18
The Empty set:
This is a set with no elements written as with
special symbol ∅. It is also known as a null set
The empty set is a subset of every set

19
Example:
Let A = { 1,3 } , B = { 3,1 } and C = { 1,3,4}

C C
Then

AB
A=B True False

A C
False B⊆A True
C⊆A False True
A⊆B True
A⊆C True
20
 Finite and infinite sets
Finite set:
A finite set is a set containing only finite number of elements.
For example, {1, 2, 3} is finite. If A is a finite set, we denote by
|A| the number of elements in A. For example, |{1, 2, 3}| = 3
and |∅| = 0.
Infinite set:
A set with infinitely many elements is called an infinite set
The set of all positive integers (also called natural numbers)
= {1, 2, 3, ........, } .
is infinite; the dots indicate that the sequence 1; 2; 3 is to be
continued indefinitely

21
 Boolean Algebra
Whe deali g ith sets, e ha e ope atio s ∩,
U a d . The a ipulatio of e p essio s
involving these symbols is called Boolean
algebra. The identities of Boolean algebra are as
follows.
Commutative laws
A∩B=B∩A
AUB = B U A

22
Idempotent laws:
A∩A=A
AUA=A
Associative laws:
A∩ B∩C = A∩B ∩C
A U (B U C) = (A U B) U C
Distributive laws:
A∩ BUC = A∩B U A∩C
AU B∩C = AUB ∩ AUC

23
Absorbtion laws:
A ∩ (A U B) = A
AU A∩B =A
Identity laws:
A∩U=A
AU∅=A
AUU=U
A∩∅=∅

24
 De Morgan's laws
A∩B =A UB
Proof :
Let A = { 1,2,3} and B = {1,2,4,5}
A∩B={ , }
A∩B = , , }
A ={ , }
B ={ }
A U B = { , , } = A ∩ B thus the p oof

AUB =A ∩B
Let the students use the given A and B above to prove this law

25