Math 2.0

Resources / course

Discrete Mathematics 4KGBPKXYZ1

URIm2://res/4KGBPKXYZ1
Kindcourse
CreatorsA.K. Lal (instructor)
Scopein
Idscourse 05pjsgx75:111104026

Expressions

e1: edition

Languageen
Contents
  • part 1: Contents
  • session 1: Contents
  • part 2: Properties of Integers and Basic Counting
  • session 2: Basic Set Theory
  • session 3: Well Ordering Principle and the Principle of Mathematical Induction
  • session 4: Strong Form of the Principle of Mathematical Induction
  • session 5: Division Algorithm and the Fundamental Theorem of Arithmetic
  • session 6: Relations, Partitions and Equivalence Relation
  • session 7: Functions
  • session 8: Distinguishable Balls
  • session 9: Binomial Theorem
  • session 10: Onto Functions and the Stirling Numbers of Second Kind
  • session 11: Indistinguishable Balls and Distinguishable Boxes
  • session 12: Indistinguishable Balls in Indistinguishable Boxes
  • session 13: Lattice Paths and Catalan Numbers
  • session 14: Catalan Numbers Continued
  • session 15: Generalizations
  • part 3: Advanced Counting and Generating Functions
  • session 16: Pigeonhole Principle
  • session 17: Pigeonhole Principle Continued
  • session 18: Principle of Inclusion and Exclusion
  • session 19: Formal Power Series
  • session 20: Formal Power Series Continued
  • session 21: Application to Recurrence Relation
  • session 22: Application to Recurrence Relation Continued
  • session 23: Application to Recurrence Relation Continued
  • session 24: Applications to Generating Functions Continued
  • part 4: Groups and Polya Theory
  • session 25: Groups
  • session 26: Example of Groups
  • session 27: SubGroups
  • session 28: Lagrange’s Theorem
  • session 29: Applications of Lagrange’s Theorem
  • session 30: Group Action
  • session 31: Group Action Continued
  • session 32: The Cycle Index Polynomial
  • session 33: Polya Inventory Theorem
  • part 5: Topics in Classical Graph Theory
  • session 34: Basic Graph Theory
  • session 35: Graph Operations
  • session 36: Matrices related with Graphs
  • session 37: Matrix Tree Theorem
  • session 38: Eulerian graphs
  • session 39: Planar Graphs
  • session 40: Euler’s Theorem for Planar Graphs
  • session 41: Stereographic Projection

Catalogue records