discrete mathematics etiketine sahip kayıtlar gösteriliyor. Tüm kayıtları göster
discrete mathematics etiketine sahip kayıtlar gösteriliyor. Tüm kayıtları göster

12 Eylül 2014 Cuma

Platonic Solids (Polyhedrons)


Polyhedron means a solid that has flat faces.

In Greek poly means "many". Also edron means "face".


TETRAHEDRON: polyhedron with four sides.

source1 source2

Tetrahedron


HEXAHEDRON: polyhedron with six sides.

 source1 source2

Hexahedron


OCTAHEDRON: polyhedron with eight sides.

source1 source2

Octahedron


DODECAHEDRON: polyhedron with twelve sides.

source1 source2 source3

Dodecahedron


ICOSAHEDRON: polyhedron with twenty sides.

source1 source2 source3

Icosahedron

Discrete Mathematics CSC 2110

This slides are copyrighted by  Chinese University of Hong Kong.



Lecture 0: about the course
 [ppt] [pdf]

  • Logic and Proofs
    • Propositional logic, first order logic.
    • Proof by cases, proof by contradiction.
    • Induction, invariant method.
Lecture 1: propositional logic [ppt] [pdf]
Lecture 2: first order logic [ppt] [pdf]
Lecture 3: methods of proofs [ppt] [pdf]
Lecture 4: mathematical induction 1 [ppt] [pdf]
Lecture 5: mathematical induction 2 [ppt] [pdf]

  • Graph Theory
    • Degree sequence, Eulerian graphs, isomorphism.
    • Trees.
    • Stable matching, bipartite matching.
    • Graph coloring, planar graphs.
Lecture 6: introduction to graphs [ppt] [pdf]
Lecture 7: stable matching [ppt] [pdf]
Lecture 8: bipartite matching [ppt] [pdf]
Lecture 9: graph coloring [ppt] [pdf]
Lecture 10: planar graph [ppt] [pdf]
Lecture 11: sets [ppt] [pdf]

  • Counting
    • Sets, functions, number sequences
    • Combinations, permutations, binomial theorem.
    • Counting by mapping, pigeonhole principle, inclusion-exclusion principle
    • Recursion, generating functions
Lecture 12: basic counting [ppt] [pdf]
Lecture 13: binomial coefficient, inclusion-exclusion [ppt] [pdf]
Lecture 14: functions, pigeonhole principle [ppt] [pdf]
Lecture 15: counting by mapping [ppt] [pdf]
Lecture 16: more counting by mapping [ppt] [pdf]
Lecture 17: number sequences [ppt] [pdf]
Lecture 18: recursion [ppt] [pdf]
Lecture 19: solving recurrence [ppt] [pdf]

Lecture Notes in Discrete Mathematics by Marcel B. Finan

That e-book is copyrighted by Marcel B. Finan in Arkansas Tech.

Arkansas Tech University


DOWNLOAD LINK          MIRROR

Contents

Fundamentals of Mathematical Logic

1 Propositions and Related Concepts
2 Conditional and Biconditional Propositions
3 Rules of Inferential Logic
4 Propositions and Quanti ers
5 Arguments with Quanti ed Premises
6 Project I: Digital Logic Design
7 Project II: Number Systems


Fundamentals of Mathematical Proofs

8 Methods of Direct Proof I
9 More Methods of Proof
10 Methods of Indirect Proofs: Contradiction and Contraposition
11 Method of Proof by Induction
12 Project III: Elementary Number Theory and Mathematical Proofs
13 Project IV: The Euclidean Algorithm
14 Project V: Induction and the Algebra of Matrices


Fundamentals of Set Theory

15 Basic De nitions
16 Properties of Sets
17 Project VI: Boolean Algebra


Relations and Functions

18 Equivalence Relations
19 Partial Order Relations
20 Functions: De nitions and Examples
21 Bijective and Inverse Functions
22 Recursion
23 Project VII: Applications to Relations
24 Project VIII: Well-Ordered Sets and Lattices
25 Project IX: The Pigeonhole Principle
26 Project X: Countable Sets
27 Project XI: Finite-State Automaton


Introduction to the Analysis of Algorithms

28 Time Complexity and O-Notation
29 Logarithmic and Exponential Complexities
30 - and -Notations


Fundamentals of Counting and Probability Theory

31 Elements of Counting
32 Basic Probability Terms and Rules
33 Binomial Random Variables
Elements of Graph Theory 201
34 Graphs, Paths, and Circuits
35 Trees