This page covers the
following topics related to Discrete Mathematics : Logic and Sets, Relations and
Functions, the Natural Numbers, Division and Factorization , Languages, Finite
State Machines, Finite State Automata, Turing Machines, Groups and Modulo
Arithmetic, Introduction to Coding Theory, Group Codes, Public Key Cryptography,
Principle of Inclusion-exclusion, Generating Functions, Number of Solutions of a
Linear Equation, Recurrence Relations, Graphs, Weighted Graphs, Search
Algorithms, Digraphs.
This
note explains the following topics: introduction to preliminaries, Counting, Sequences, Symbolic logic
and proofs, Graph theory, Additional topics.
This PDF covers the following topics related to Discrete
Mathematics : Introduction, Sets, Functions, Counting, Relations, Sequences,
Modular Arithmetic, Asymptotic Notation, Orders.
Author(s): Andrew D. Ker, Oxford University Computing
Laboratory
This PDF covers the following
topics related to Discrete Mathematics : Introduction, Propositional Logic,
Sets, and Induction, Relations, Functions, Counting, Sequences, Graphs and
trees, A glimpse of infinity.
This
note covers the following topics: Sets, Functions and Relations, Proofs
and Induction, Number Theory, Counting, Probability, Logic, Graphs, Finite
Automata.
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.
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
Graph Theory.
Author(s): Marcel B. Finan, Arkansas Tech
University
This note
covers the following topics: induction, counting subsets, Pascal's triangle,
Fibonacci numbers, combinatorial probability, integers divisors and primes,
Graphs, Trees, Finding the optimum, Matchings in graphs, Graph coloring.
This book consists of six units of study: Boolean Functions and
Computer Arithmetic, Logic, Number Theory and Cryptography, Sets and Functions,
Equivalence and Order, Induction, Sequences and Series. Each of this is divided into two sections.
Each section contains a representative selection of problems. These vary from
basic to more difficult, including proofs for study by mathematics students or
honors students.
Author(s): Edward A. Bender and S. Gill
Williamson
This note explains the following topics: Relations, Maps, Order
relations, Recursion and Induction, Bounding some recurrences, Graphs, Lattices
and Boolean Algebras.
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
This note covers the
following topics: Logic and Foundations, Proposition logic and
quantifiers, Set Theory, Mathematical Induction, Recursive Definitions,
Properties of Integers, Cardinality of Sets, Pigeonhole Principle,
Combinatorial Arguments, Recurrence Relations.
This
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
Fractions.