Difference between revisions of "User:Temperal/The Problem Solver's Resource6"
(topic) |
(this belongs in limits...) |
||
Line 34: | Line 34: | ||
If <math>a|bc</math> and <math>(a,b) = 1</math>, then <math>a|c</math>. | If <math>a|bc</math> and <math>(a,b) = 1</math>, then <math>a|c</math>. | ||
− | |||
− | |||
===Errata=== | ===Errata=== |
Revision as of 12:12, 23 November 2007
Number TheoryThis section covers number theory, especially modulos (moduli?). Definitions
Special NotationOccasionally, if two equivalent expressions are both modulated by the same number, the entire equation will be followed by the modulo. PropertiesFor any number there will be only one congruent number modulo If Fermat's Little TheoremFor a prime Wilson's TheoremFor a prime Fermat-Euler IdentitityIf Gauss's TheoremIf
ErrataAll quadratic residues are |