Difference between revisions of "Number theory"
m (xs syntax) |
(added SFFT internal links) |
||
| Line 18: | Line 18: | ||
* [[Base numbers]] | * [[Base numbers]] | ||
* [[Diophantine equations]] | * [[Diophantine equations]] | ||
| + | ** [[Simon's Favorite Factoring Trick]] | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
** [[Linear congruence]] | ** [[Linear congruence]] | ||
| Line 26: | Line 27: | ||
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]]. | 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]]. | ||
* [[Diophantine equations]] | * [[Diophantine equations]] | ||
| + | ** [[Simon's Favorite Factoring Trick]] | ||
* [[Euclidean algorithm]] | * [[Euclidean algorithm]] | ||
* [[Modular arithmetic]] | * [[Modular arithmetic]] | ||
Revision as of 22:36, 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.
- Diophantine equations
- Euler's Totient Theorem
- Fermat's Little Theorem
- Modular arithmetic
- Wilson's Theorem
