Concept information
Preferred term
modular arithmetic
Definition
-
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Modular_arithmetic)
Broader concept
Narrower concepts
- automorphic number
- congruence of squares
- Dixon's factorization method
- Euler's criterion
- Euler's four-square identity
- Fermat's theorem on sums of two squares
- Gaussian period
- Jordan's totient function
- Lagrange's four-square theorem
- Legendre's three-square theorem
- quadratic residue
- quadratic sieve
- Thue's lemma
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/PSR-NM1F1MRK-M
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}