Abstract Algebra Algebra Algebraic Geometry Algebraic Topology Applied Mathematics Arithmetic Geometry Basic Algebra Basic Mathematics Calculus Category Theory Classical Analysis Combinatorics Commutative Algebra Complex Algebra Complex Analysis Differential Algebra Differential Analysis Differential Calculus Differential Equations Differential Geometry Differential Topology Discrete Mathematics Elliptic Curves Fourier Analysis Functional Analysis Fractals Fractional Calculus Geometric Algebra Geometry Geometric Topology Groups Theory Graph Theory Harmonic Analysis Higher Algebra History of Mathematics Homological Algebra Integral Calculus K-theory Lie Algebra Linear Algebra Mathematical Analysis Mathematical Series Modern Geometry Multivairable Calculus Number Theory Numerical Analysis Probability Theory Real Analysis Rings and Fileds Riemannian Geometry Theorems in Calculus Topology Trigonometry Set Theory Constants & Numerical Sequences
Discrete Mathematics for Computer Science
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.
Author(s): Mike Clancy, David Wagner
NA Pages 
Discrete Mathematics An Open Introduction
This book contains below topics, Sue gets an A in the class, We haveP Q and P, soQ follows Sue gets an A, am asleep if dream, dream only if am asleep, In order to dream, must be asleep, To dream, it is necessary that am asleep, To be asleep, it is sucient to dream, dream if am asleep, am asleep only if dream, It is necessary that dream in order to be asleep, It is sucient that be asleep in order to dream.
Author(s): Oscar Levin
414 Pages
This book contains below topics, Functions between finite sets, Binomial coefficients, Recursive matrices and generating functions, Multisets and multiset coefficients, Equations with natural integer solutions, Three statistics of Quantum Physics, Compositions of finite sets and multinomial coefficients, Equivalence relations and partitions, Permutations, Some polynomial identities, An introduction to the MoebiusRota inversion theory.
Author(s): Andrea Brini, Antonio Teolis
77 Pages
Discrete Mathematics by Andrew D Ker
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
125 Pages
Discrete Mathematics by William Chen
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 Inclusionexclusion, Generating Functions, Number of Solutions of a Linear Equation, Recurrence Relations, Graphs, Weighted Graphs, Search Algorithms, Digraphs.
Author(s): William Chen
NA Pages
Lecture Notes On Discrete Mathematical Structures iare
The contents include, Mathematical Logic, Relations, Algebraic structures, Recurrence Relation, Graph Theory.
Author(s): Mrs. B Pravallika, Assistant Professor,Information Technology, Institute of Aeronautical Engineering
95 Pages
Discrete Mathematics II Set Theory for Computer Science
The aim of this note is to introduce fundamental concepts and techniques in set theory in preparation for its many applications in computer science. Topics covered includes, Mathematical argument, Sets and Logic, Relations and functions, Constructions on sets, Wellfounded induction.
Author(s): Glynn Winskel
112 Pages
Discrete Mathematics Lecture Notes Incomplete Preliminary Version
This note covers the following topics, Logic, Asymptotic Notation, Convex Functions and Jensens Inequality, Basic Number Theory, Counting, Binomial coefficients, Graphs and Digraphs, Finite Probability Space, Finite Markov Chains.
Author(s): Laszlo Babai
96 Pages
A Course in Discrete Structures
This note covers the following topics, Sets, Functions and Relations, Proofs and Induction, Number Theory, Counting, Probability, Logic, Graphs, Finite Automata.
Author(s): Rafael Pass and Wei-Lung Dustin Tseng
153 Pages