Universidad

de Puerto Rico
Recinto de Rio Piedras

Facultad de Ciencias Naturales

Departamento de Ciencias en Computadoras

Course Title: Discrete Mathematics
Code: CCOM 3020
Number of Credit/Hours: Three (3) Credits. Three hours of lecture per week.
Instructor: Ivelisse Rubio Canabal / ivelisse.canabal@upr.edu
Course Description: This course is designed for students who attend their first or second year in
the Computer Science program or a Mathematics program. In this course students will learn
techniques to produce elementary mathematical demonstrations. The course also will introduce
students to topics related to:

- Logic, basic set theory, proof techniques, relations, functions, countability and counting
argument, mathematical induction, graph theory, combinatorics, discrete probability,
recurrence relations, number theory and cryptography.
Este curso esta diseñado para estudiantes que están en su primer o segundo año en su programa
de ciencias en computadoras o el de matemáticas. En este curso, los estudiantes aprenderán las
técnicas para producir demonstraciones matemáticas. El curso introducirá a los estudiantes a
temas relacionados:
- Lógica, teoría elemental de conjuntos, técnicas de demostraci6n, relaciones, funciones,
Conteo y argumentos de conteo, inducción matemática, teoría de grafos, combinatoria,
probabilidad discreta, relaciones de recurrencia, teoría de números y criptografía.
Course Outcomes:
• The student will learn the basics of mathematical reasoning and logic.
• The student will be able to do elementary proofs on the topics learned in the course.
• The student will know about the basic concepts and methods of discrete mathematics
and its applications.
• The student will be able to use sets, its operations and relations to structure data,
understand and solve mathematical problems.
• The student will know different types of relations and functions between sets and how
to represent them.
• The student will know concepts and algorithms related the integers.
• The student will know and will be able to use mathematical induction to establish
recurrence relations.
• The student will know basic counting techniques and will be able to solve problems in
combinatorics and discrete probability.
• The student will know basic concepts, algorithms and problems on graphs and trees and
how to use these structures to organize and process data.
 • The student will apply the concepts learned in class to solve problems.

Course Outline and Distribution of Time:

Properties of Numbers (3 hours)

Numbers

Summation Notation

Bases

Scientific Notation

Arithmetic in Computers

Elementary set theory and methods of (5 hours)

proof

Propositions and truth tables

Sets and operations on sets

Introduction to Proofs

Syllogisms and Venn diagrams

Induction and Recursion (4 hours)

Mathematical Induction

Strong Induction

The well-ordering principle

Recursive definitions, recursive algorithms

Boolean Algebras and Circuits (4 hours)

Boolean Algebras
 Boolean Forms

Disjunctive Forms

Digital circuits

(5 hours)
Relations and Functions

Binary relations

Equivalence relations

Definition of a function

Composition of functions, inverse function

(6 hours)
Counting

The basics of counting

The inclusion-exclusion principle

Permutations & Combinations

The binomial theorem

Bijections and infinite sets.

Finite and infinite sets.

Countable sets

(6 hours)
Probability

Probability: elementary concepts

Repeated Experiments
 Counting and Probability

Conditional Probability

Bayes’ Formula

(6 hours)
Graph Theory
Introduction to Graphs

Walks, Paths and Cycles

Distances and Shortest Path

Trees

Hamiltonian Cycles

(6 hours)
Number Theory and Cryptography

Elementary Number Theory

Primes and divisors

Greatest common divisor and the Euclidian

algorithm

Modular arithmetic. Chinese remainder Theorem

Introduction to Cryptography

The RSA system

Instructional Strategies Lecture:
Politics on Absence
If the students miss one of the exams, then they should bring reasonable evidence
(which has to go through the school’s system for evaluation) that reflects the
motive of their absent. In this case, the professor would decide to reschedule the
exam on a reasonable time.
Evaluation Strategies
Grade will be based on: two partial exams (25 % each), Assignments and projects
(20%), a final exam (30%). According to Law 51 (ADA) alternative evaluation
strategies may be used with students who have special needs.
Credit System
A, B, C, D, F.
Textbook

Discrete Mathematics and Its Applications by Kenneth Rosen, 7th edition. 2011.

Student Solutions Guide for Discrete Mathematics and Its Applications. 7th Edition.

References
1. Biggs, Norman L: Discrete Mathematics; New York: Oxford University Press, 1994
2. Chen, W.W.: Lecture Notes http://www.maths.mq.edu.au/wchen/Indmfolder/Indm.html
3. Diestel, R.: Graph Theory
http://www.math.unihamburg.de/home/diestel/books/graph.theory/GraphTheoryII.pdf
4. Epp, Susanna S.: Discrete Mathematics with Application, Brooks Cole; 3rd edition,
2003
5. Goodaire, E. and Parmenter, M: Discrete Mathematics with Graph Theory, 2nd Edition;
Prentice Hall,2002 • Knuth, D.E.: Selected Papers on Discrete Mathematics, Center for
the Study of Language and Inf, 1 edition 2004
6. Lax, R. F.: Modern Algebra and Discrete Structures, Reading, Mass.: Addison-Wesley,
1991. • MacGillivray, G.: Lecture Notes http:
www.math.uvic.ca/faculty/gmacgill/guide/
7. Wallis, W.D: A Beginner's Guide to Discrete Mathematics, Birkhauser. (2002)
8. Kennth H Rosen, Discrete Mathematics and its Applications, McGraw-Hill, 5 editions
(2006)
Rights of Students with Disabilities: UPR complies with all federal and state laws and
regulations regarding discrimination, including the Americans with Disabilities Act 1990 (ADA)
and the Commonwealth of Puerto Rico Law 51. Students with disabilities must inform the
professor in charge of the course about their special needs. Accordingly, the professor will make
appropriate arrangements to provide reasonable accommodation for equal access to education or
services at the UPR.

Academic Integrity: Honest, comprehensive and respectful conduct is expected in all the
activities of the course, and in particular during the exam period. "It is the institutional policy of
the Río Piedras Campus to promote the highest standards of academic integrity and sanction the
violation of them." Circular No. 17 (1989-1990)