Home
Random
Log in
Settings
Donations
About Wikibooks
Disclaimers
Search
IB Mathematics (HL)/Discrete Mathematics
Language
Watch
Edit
<
IB Mathematics (HL)
Contents
1
Topic 11. Discrete Mathematics
1.1
Natural Numbers
1.2
Mathematical Induction
1.3
Division and the Euclidean Algorithm
1.4
Modular Congruences
1.4.1
Diophantine Equations
1.5
Recurrence Relations
1.6
Graph Theory
1.6.1
Graphs
1.6.2
Walks
1.6.3
Networks and Trees
1.6.4
Graph Algorithms
1.6.4.1
Dijkstra's Algorithm
1.6.4.2
Kruskal's Algorithm
1.6.4.3
Prim's Algorithm
Topic 11. Discrete Mathematics
edit
Natural Numbers
edit
Whole numbers from 1 and above: {1, 2, 3...}
Mathematical Induction
edit
Division and the Euclidean Algorithm
edit
Modular Congruences
edit
Diophantine Equations
edit
Recurrence Relations
edit
Graph Theory
edit
Graphs
edit
Walks
edit
Networks and Trees
edit
Graph Algorithms
edit
Dijkstra's Algorithm
edit
Kruskal's Algorithm
edit
Prim's Algorithm
edit