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.
note covers the following topics: Logic, Asymptotic Notation, Convex Functions
and Jensenís Inequality, Basic Number Theory, Counting, Binomial coefficients,
Graphs and Digraphs, Finite Probability Space, Finite Markov Chains.
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
Author(s): Marcel B. Finan, Arkansas Tech
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: Computation, Finite State Machines, Logic,
SetsSet Theory, Three Theorems, Ordinals, Relations and Functions,
Induction, Combinatorics, Algebra, Cellular Automata and FSRs.
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
book explains the following topics: Computability, Initiation to Complexity Theory, The Turing Model: Basic
Results, Introduction to the Class NP, Reducibilities, Complete
Languages, Separation Results, Stochastic Choices, Quantum Complexity,
Theory of Real Computation and Kolmogorov Complexity.