コース · College
Discrete Mathematics
Logic, proof, induction, relations, counting, recurrences, graphs, automata and complexity: the discrete maths of a first university course.
A complete first university course in discrete mathematics, in the order it is usually taught: propositional and predicate logic and the standard proof techniques; induction in all its forms; sets, relations and functions, including countable and uncountable sets; counting with the product rule, bijections and the pigeonhole principle; recurrence relations and how to solve them; graphs, trees, Euler and Hamilton paths and colouring; Boolean algebra, circuits and finite automata; and finally algorithms, asymptotic analysis, the master theorem, satisfiability and polynomial-time reductions.
It is for anyone comfortable with school algebra who wants to reason precisely about finite and countable structures, and it is the mathematical core of a computer science degree. Each unit ends with a quiz mixing computation, concepts and short proofs; the final exam covers the whole course.
後に来る: Algebra
コース
-
Logic and proof
25 レッスンWhat is Discrete Mathematics?Discrete StructuresDiscrete mathematicsTruth tablesMathematical StatementsStatements and QuantifiersCompound StatementsConstructing Truth TablesTruth Tables for the Conditional and BiconditionalImplicationsEquivalent StatementsDe Morgan’s LawsRules of LogicLogical ArgumentsPredicate logic and quantifiersProofsDirect proof, contrapositive and contradictionProofs about Discrete StructuresChapter SummaryPropositional calculusLogical connectiveTruth tableFirst-order logicQuantifier (logic)Predicate (mathematical logic) -
Induction and sequences
11 レッスン -
Sets, relations and functions
20 レッスンSetsRelations: equivalence relations and partial ordersFunctionsFunctions and cardinalityIntroduction to Number TheoryCryptographyCartesian productPower setBinary relationEquivalence relationPartial orderFunction (mathematics)Injective functionSurjective functionBijectionComposite functionInverse functionCardinal numberCountable setUncountable set -
Counting
16 レッスンCounting: rules, choices and bijectionsThe pigeonhole principleVoting MethodsFairness in Voting MethodsStandard Divisors, Standard Quotas, and the Apportionment ProblemApportionment MethodsFairness in Apportionment MethodsEnumerative combinatoricsPermutationCombinationBinomial coefficientPascal's trianglePigeonhole principleInclusion–exclusion principleBijective proofDouble counting (proof technique) -
Recursion and recurrence relations
7 レッスン -
Graphs and trees
18 レッスンGraphs: degrees, paths and connectivityTrees and spanning treesEuler and Hamilton pathsGraph colouringGraph theoryGraph (discrete mathematics)Degree (graph theory)Path (graph theory)Cycle (graph theory)Connectivity (graph theory)Tree (graph theory)Spanning treeEulerian pathHamiltonian pathBipartite graphPlanar graphGraph coloringAdjacency matrix -
Boolean algebra and automata
7 レッスン -
Algorithms and complexity
15 レッスンAlgorithms and growth of functionsAlgorithmRate of GrowthBig O notationAsymptotic analysis, recursion trees and the master theoremSorting algorithmComputational complexity theoryDecision problems, satisfiability and reductionsMath and ArtMath and the EnvironmentMath and MedicineMath and MusicMath and SportsComputability theoryHalting problem
卒業試験
ユニットごとに問題があり、最も難しい問題が残ります。タイプした答えは代数システムでマークされ、証明と写真の作業はモデルによって読まれ、その後、結果を公開する前に人が全ての論文をレビューします。合格すると、リンク付きの証明書を受け取ります。 合格点: 70%.
ログイン