Metraipolis › archive › dc_aa62ddbd583b

Modular arithmetic — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Modular_arithmetic
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T14:28:38.651Z
SHA-256 of the archived text: 8645f83701c73d60087ed78c4aa87749dd8baeb06aa20bd50547692460d2af91
Stable URL of this page: https://metraipolis.com/documento/dc_aa62ddbd583b

How to cite

Modular arithmetic — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Modular_arithmetic (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aa62ddbd583b (Metraipolis archive dc_aa62ddbd583b, sha256 8645f83701c73d60087ed78c4aa87749dd8baeb06aa20bd50547692460d2af91)

BibTeX

@misc{dcaa62ddbd583b,
  title = {Modular arithmetic — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Modular_arithmetic},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aa62ddbd583b; sha256 8645f83701c73d60087ed78c4aa87749dd8baeb06aa20bd50547692460d2af91},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Modular_arithmetic. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when reaching or exceeding a certain value, called the modulus. The modern approach to number theory using modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801. Modular arithmetic modulo m consists of systematically replacing the results of additions, multiplications, and subtractions by the remainder of the division by m. A remarkable property of modular arithmetic is that the result of a computation does not depend on whether the division by m is performed after each operation, only once at the end of the computation, or at the end of the computation and after some intermediate results—typically when an intermediate result becomes too large.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Modular arithmetic» — https://en.wikipedia.org/wiki/Modular_arithmetic
Wikidata Q319400 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q319400
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Modular_arithmetic?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378015346, consultata il 2026-10-07T14:08:02.546Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 06ea03694a1d91f5b91a2242fdada6fe0dac6876c4146d047efc9c5d2d8f2fff