IB Mathematics (HL)/Discrete Mathematics

< IB Mathematics (HL)

Topic 11. Discrete Mathematics

Natural Numbers

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

Mathematical Induction

Division and the Euclidean Algorithm

Modular Congruences

Diophantine Equations

Recurrence Relations

Graph Theory

Graphs

Walks

Networks and Trees

Graph Algorithms

Dijkstra's Algorithm

Kruskal's Algorithm

Prim's Algorithm

Retrieved from "https://en.wikibooks.org/w/index.php?title=IB_Mathematics_(HL)/Discrete_Mathematics&oldid=4239879"

NODES