Course Title: Discrete Mathematics and Combinatory
Course No: Math 261
Credit Hours: 3
Contact Hours: 3 (3 Lect. hrs.)
Prerequisite: Stat 192
Laboratory: NA
Course Objectives
At the end of the course the student will be able to:
•Describe relationship b/n two or more sets
•Describe property and types of functions.
•Use the different rules of induction to proof advanced problems or identities.
•Calculate the shortest distance b/n two points and relate with real applications
•Count the number of possible outcomes of events
Course Description
This course surveys diverse topics as the logical foundations of mathematics, number theory, and
combinatory and graph theory. This survey advances three goals. First, by introducing students
to a range of concepts, we begin the gradual, subconscious process of developing intuition about
these concepts. Second, these areas provide a setting in which students can learn to give rigorous
proofs. And third, these particular areas naturally lend themselves to the aesthetic qualities of
mathematics, and to the creative aspects of the mathematical process. Lectures will be centered
on number theoretic and combinatorial problems. These problems will motivate our exploration
of the techniques used in the class techniques such as modular arithmetic, mathematical
induction and combinatorial proofs. In addition to attending lectures, students will have the
opportunity to work in groups to solve problems in class.
Course Contents
1. Counting Method
1.1. Introduction
1.1. Concepts and description of sets,
1.2. Relationships of sets,
1.3. Operations with sets,
1.4. Cartesian product of sets ,
