IB Mathematics (HL)/Discrete Mathematics

From Wikibooks, open books for an open world
Jump to navigation Jump to search

Topic 11. Discrete Mathematics[edit | edit source]

Natural Numbers[edit | edit source]

Whole numbers from 1 and above: {1, 2, 3...}

Mathematical Induction[edit | edit source]

Division and the Euclidean Algorithm[edit | edit source]

Modular Congruences[edit | edit source]

Diophantine Equations[edit | edit source]

Recurrence Relations[edit | edit source]

Graph Theory[edit | edit source]

Graphs[edit | edit source]

Walks[edit | edit source]

Networks and Trees[edit | edit source]

Graph Algorithms[edit | edit source]

Dijkstra's Algorithm[edit | edit source]
Kruskal's Algorithm[edit | edit source]
Prim's Algorithm[edit | edit source]