Difference between revisions of "Number theory"
(→Olympiad Topics) |
(added some subitems) |
||
| Line 18: | Line 18: | ||
* [[Diophantine equations]] | * [[Diophantine equations]] | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
| + | ** [[Linear congruence]] | ||
| Line 26: | Line 27: | ||
* [[Euclidean algorithm]] | * [[Euclidean algorithm]] | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
| + | ** [[Linear congruence]] | ||
| + | *** [[Chinese Remainder Theorem]] | ||
** [[Euler's Totient Theorem]] | ** [[Euler's Totient Theorem]] | ||
** [[Fermat's Little Theorem]] | ** [[Fermat's Little Theorem]] | ||
** [[Wilson's Theorem]] | ** [[Wilson's Theorem]] | ||
| + | |||
== Olympiad Topics == | == Olympiad Topics == | ||
Revision as of 18:50, 19 June 2006
Number theory is the field of mathematics associated with studying the integers.
Introductory Topics
The following topics make a good introduction to number theory.
Intermediate Topics
An intermediate level of study involves many of the topics of introductory number theory, but involves an infusion of mathematical problem solving as well as algebra.
Olympiad Topics
An Olympiad level of study involves familiarity with intermediate topics to a high level, a few new topics, and a highly developed proof writing ability.
