UNIVERSITY OF SOUTHERN MINDANAO

DISCRETE
MATHEMATICS
 INTRODUCTION
Discrete mathematics is the study of separate
and distinct elements. It plays a crucial role in
computer science and cryptography. This
presentation will explore key concepts and
examples in discrete mathematics.

2
Set Theory: Building Blocks of
Discrete Mathematics
Set theory is the
foundation of discrete
mathematics, dealing with
collections of objects. It
includes operations such
as union, intersection,
and complement.
Understanding set theory
is essential for problem-
solving in discrete
mathematics.
3
 Graph Theory: Exploring
Connections
Graph theory focuses on
the study of graphs and
their properties. It is used
to model relationships and
connections in various
applications, including
social networks and
transportation systems.
This slide will delve into
graph terminology and
applications
Insert Running Title 4
Combinatorics: Counting and
Arranging

Combinatorics deals with

counting and arranging
objects. It includes topics
such as permutations,
combinations, and the
pigeonhole principle. This
section will showcase real-
world examples and
problem-solving strategies
in combinatorics.
Insert Running Title 5
 Number Theory: Unveiling
Secrets of Integers
Number theory is the
study of integers and
their properties. It
encompasses topics
like prime numbers,
divisibility, and
modular arithmetic.
This slide will highlight
the significance of
number theory in
cryptography and
computer science.
Insert Running Title 6
THANKS!!!!