The word discrete in mathematics is in contrast to the word continuous. For example, the set of integers is discrete, while the set of real numbers is continuous. Thus, discrete mathematics describes a collection of branches of mathematics with the common characteristic that they focus on the study of things consisting of separate, irreducible, often finite parts. Although largely neglected in typical precollege mathematics curricula, discrete mathematics is essential for developing logic and problem-solving abilities. Questions located within the realm of discrete mathematics naturally invite creativity and innovative thinking that go beyond formulas. Furthermore, the cultivation of logical thinking forms a necessary foundation for proof-writing. For these reasons, discretemathematics is critical for undergraduate study of bothmathematics and computer science.
[1]
N. S. Mendelsohn,et al.
Coverings of Bipartite Graphs
,
1958,
Canadian Journal of Mathematics.
[2]
J. Paul Tremblay,et al.
Discrete Mathematical Structures with Applications to Computer Science
,
1975
.
[3]
Ronald L. Graham,et al.
Concrete mathematics - a foundation for computer science
,
1991
.
[4]
Ralph P. Grimaldi,et al.
Discrete and Combinatorial Mathematics: An Applied Introduction
,
1998
.
[5]
Lovász,et al.
Discrete Mathematics: Elementary and Beyond
,
2003
.
[6]
Eli Upfal,et al.
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
,
2005
.
[7]
Swastik Kopparty,et al.
TO PLANAR GRAPHS
,
2010
.
[8]
Michael Meyling,et al.
Axiomatic Set Theory
,
2008
.
[9]
Sidneyf Elder,et al.
ELEMENTS OF SET THEORY
,
1995
.