This note explains the
following topics: positional and modular number systems, relations and their
graphs, discrete functions, set theory, propositional and predicate logic,
sequences, summations, mathematical induction and proofs by contradiction.
This is a course
note on discrete mathematics as used in Computer Science. Topics covered
includes: Mathematical logic, Set theory, The real numbers, Induction and
recursion, Summation notation, Asymptotic notation, Number theory, Relations,
Graphs, Counting, Linear algebra, Finite fields.
explains the following topics: Arithmetic, Logic and Numbers, Boolean Functions
and Computer Arithmetic, Number Theory and Cryptography, Sets, Equivalence and
Order, Functions, Induction, Sequences and Series, Lists, Decisions and Graphs,
Basic Counting and Listing, Decision Trees, Basic Concepts in Graph Theory.
Author(s): Edward A. Bender and S. Gill Williamson
This note covers the following topics: fundamentals of
mathematical logic , fundamentals of mathematical proofs , fundamentals of
set theory , relations and functions , introduction to the Analysis of
Algorithms, Fundamentals of Counting and Probability Theory and Elements of
Author(s): Marcel B. Finan, Arkansas Tech
The goal of this lecture note is to introduce students to ideas and
techniques from discrete mathematics that are widely used in Computer
Science. This note covers the following topics: Propositional logic,
Induction, Strong induction, Structural induction, Proofs about algorithms,
Algebraic algorithms, Number theory, RSA, Basics of counting, basic
probability,Conditional probability, Linearity of expectation, variance.
This note covers the following topics:
Compound Statements, Sets and subsets, Partitions and counting,
Probability theory, Vectors and matrices, Linear programming and the
theory of games, Applications to behavioral science problems.
Author(s): John G. Kemeny, J. Laurie
Snell, and Gerald L. Thompson
book explains the following topics: Arithmetic, The Greatest Common Divisor, Subresultants, Modular
Techniques, Fundamental Theorem of Algebra, Roots of Polynomials, Sturm
Theory, Gaussian Lattice Reduction, Lattice Reduction and Applications,
Linear Systems, Elimination Theory, Groebner Bases, Bounds in Polynomial Ideal Theory and Continued