• Урок 1. 00:00:20
    Introduction
  • Урок 2. 00:08:42
    Definition of a Set
  • Урок 3. 00:10:08
    Number Sets
  • Урок 4. 00:09:17
    Set Equality
  • Урок 5. 00:09:57
    Set-Builder Notation
  • Урок 6. 00:11:50
    Types of Sets
  • Урок 7. 00:10:28
    Subsets
  • Урок 8. 00:05:07
    Power Set
  • Урок 9. 00:05:00
    Ordered Pairs
  • Урок 10. 00:14:09
    Cartesian Products
  • Урок 11. 00:03:39
    Cartesian Plane
  • Урок 12. 00:03:15
    Venn Diagrams
  • Урок 13. 00:14:36
    Set Operations (Union, Intersection)
  • Урок 14. 00:10:17
    Properties of Union and Intersection
  • Урок 15. 00:11:58
    Set Operations (Difference, Complement)
  • Урок 16. 00:07:30
    Properties of Difference and Complement
  • Урок 17. 00:08:18
    De Morgan’s Law
  • Урок 18. 00:15:50
    Partition of Sets
  • Урок 19. 00:00:40
    Extra Practice Problems
  • Урок 20. 00:00:23
    Introduction
  • Урок 21. 00:07:14
    Statements
  • Урок 22. 00:13:11
    Compound Statements
  • Урок 23. 00:09:21
    Truth Tables
  • Урок 24. 00:13:04
    Examples
  • Урок 25. 00:06:41
    Logical Equivalences
  • Урок 26. 00:06:16
    Tautologies and Contradictions
  • Урок 27. 00:11:35
    De Morgan’s Laws in Logic
  • Урок 28. 00:03:24
    Logical Equivalence Laws
  • Урок 29. 00:12:59
    Conditional Statements
  • Урок 30. 00:09:32
    Negation of Conditional Statements
  • Урок 31. 00:07:26
    Converse and Inverse
  • Урок 32. 00:08:47
    Biconditional Statements
  • Урок 33. 00:11:51
    Examples
  • Урок 34. 00:12:55
    Digital Logic Circuits
  • Урок 35. 00:15:19
    Black Boxes and Gates
  • Урок 36. 00:06:24
    Boolean Expressions
  • Урок 37. 00:09:25
    Truth Tables and Circuits
  • Урок 38. 00:06:38
    Equivalent Circuits
  • Урок 39. 00:07:13
    NAND and NOR Gates
  • Урок 40. 00:07:37
    Quantified Statements - ALL
  • Урок 41. 00:06:40
    Quantified Statements - THERE EXISTS
  • Урок 42. 00:08:30
    Negations of Quantified Statements
  • Урок 43. 00:00:36
    Introduction
  • Урок 44. 00:12:44
    Parity
  • Урок 45. 00:10:46
    Divisibility
  • Урок 46. 00:08:04
    Prime Numbers
  • Урок 47. 00:08:35
    Prime Factorization
  • Урок 48. 00:17:24
    GCD & LCM
  • Урок 49. 00:05:42
    Intro
  • Урок 50. 00:07:38
    Terminologies
  • Урок 51. 00:08:46
    Direct Proofs
  • Урок 52. 00:11:26
    Proofs by Contrapositive
  • Урок 53. 00:17:17
    Proofs by Contradiction
  • Урок 54. 00:13:37
    Exhaustion Proofs
  • Урок 55. 00:15:58
    Existence & Uniqueness Proofs
  • Урок 56. 00:11:42
    Proofs by Induction
  • Урок 57. 00:18:47
    Examples
  • Урок 58. 00:00:25
    Intro
  • Урок 59. 00:15:06
    Functions
  • Урок 60. 00:12:30
    Evaluating a Function
  • Урок 61. 00:15:57
    Domains
  • Урок 62. 00:05:30
    Range
  • Урок 63. 00:09:44
    Function Composition
  • Урок 64. 00:09:01
    Function Combination
  • Урок 65. 00:08:20
    Even and Odd Functions
  • Урок 66. 00:08:20
    One to One Functions
  • Урок 67. 00:10:12
    Inverse Functions
  • Урок 68. 00:00:26
    Intro
  • Урок 69. 00:10:28
    The Language of Relations
  • Урок 70. 00:12:45
    Relations on Sets
  • Урок 71. 00:06:06
    The Inverse of a Relation
  • Урок 72. 00:13:08
    Reflexivity, Symmetry and Transitivity
  • Урок 73. 00:07:32
    Examples
  • Урок 74. 00:07:49
    Properties of Equality & Less Than
  • Урок 75. 00:06:43
    Equivalence Relation
  • Урок 76. 00:06:31
    Equivalence Class
  • Урок 77. 00:00:29
    Intro
  • Урок 78. 00:11:26
    Graphs
  • Урок 79. 00:08:33
    Subgraphs
  • Урок 80. 00:09:53
    Degree
  • Урок 81. 00:23:23
    Sum of Degrees of Vertices Theorem
  • Урок 82. 00:09:16
    Adjacency and Incidence
  • Урок 83. 00:16:17
    Adjacency Matrix
  • Урок 84. 00:08:05
    Incidence Matrix
  • Урок 85. 00:08:24
    Isomorphism
  • Урок 86. 00:12:42
    Walks, Trails, Paths, and Circuits
  • Урок 87. 00:10:19
    Examples
  • Урок 88. 00:06:48
    Eccentricity, Diameter, and Radius
  • Урок 89. 00:20:04
    Connectedness
  • Урок 90. 00:17:45
    Euler Trails and Circuits
  • Урок 91. 00:10:16
    Fleury’s Algorithm
  • Урок 92. 00:05:47
    Hamiltonian Paths and Circuits
  • Урок 93. 00:14:09
    Ore's Theorem
  • Урок 94. 00:12:59
    The Shortest Path Problem
  • Урок 95. 00:00:20
    Intro
  • Урок 96. 00:03:06
    Terminologies
  • Урок 97. 00:03:32
    Mean
  • Урок 98. 00:03:12
    Median
  • Урок 99. 00:03:03
    Mode
  • Урок 100. 00:08:02
    Range
  • Урок 101. 00:04:19
    Outlier
  • Урок 102. 00:09:26
    Variance
  • Урок 103. 00:04:15
    Standard Deviation
  • Урок 104. 00:03:30
    Intro
  • Урок 105. 00:07:47
    Factorials
  • Урок 106. 00:13:26
    The Fundamental Counting Principle
  • Урок 107. 00:12:51
    Permutations
  • Урок 108. 00:12:02
    Combinations
  • Урок 109. 00:06:11
    Pigeonhole Principle
  • Урок 110. 00:08:21
    Pascal's Triangle
  • Урок 111. 00:00:20
    Intro
  • Урок 112. 00:06:30
    Sequence
  • Урок 113. 00:12:20
    Arithmetic Sequences
  • Урок 114. 00:08:58
    Geometric Sequences
  • Урок 115. 00:11:57
    Partial Sums of Arithmetic Sequences
  • Урок 116. 00:06:32
    Partial Sums of Geometric Sequences
  • Урок 117. 00:12:33
    Series
  • Урок 118. 00:02:47
    Bonus Lecture
Этот курс находится в платной подписке. Оформи премиум подписку и смотри Discrete Mathematics, а также все другие курсы, прямо сейчас!
Премиум