The SlugMath Wiki is under heavy development!
Clust/Basic number theory
Title: Basic number theory
Basic number theory includes properties of natural numbers, integers, and rational numbers, including the Euclidean algorithm, primality, divisibility and factorization, linear Diophantine equations, and canonical decompositions.
|Def/Canonical decomposition into primes||Canonical decomposition into primes|
|Def/Composite number||Composite number|
|Def/Division with remainder||Division of integers with remainder|
|Def/Euclidean algorithm||Euclidean algorithm|
|Def/Greatest common divisor||Greatest common divisor|
|Def/Least common multiple||Least common multiple|
|Def/Prime number||Prime Number|
|Def/Relatively prime||Relatively prime|
|Def/Sequence of primes||Sequence of primes|
Below, you should see a graph of the definitions and statements, and the deductive reliances among them. This graph may be too small to read as displayed below. Until a zoomable svg applet is installed, you can try one of the following (in Firefox):
- Right-click on the graph, and click on "This Frame", then "Show only this frame".
- Right-click on the graph, and click on "This Frame", then "View frame source".
The "frame source" is the SVG (scalable vector graphics) file, which can then be saved, and viewed and edited using many software utilities, such as Inkscape.