Modular arithmetic
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.
- Comment
- enIn 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.
- Depiction
- Has abstract
- enIn 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. A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in 7 + 8 = 15, but clocks "wrap around" every 12 hours. Because the hour number starts over at zero when it reaches 12, this is arithmetic modulo 12. In terms of the definition below, 15 is congruent to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock.
- Hypernym
- System
- Id
- enp/c024850
- Is primary topic of
- Modular arithmetic
- Label
- enModular arithmetic
- Link from a Wikipage to an external page
- archive.org/details/elementsofnumber0000pett
- web.archive.org/web/20131102014013/http:/www.kuttaka.org/Gauss_Modular.pdf
- genealogy.math.ndsu.nodak.edu/id.php%3Fid=3545
- web.archive.org/web/20060101075602/http:/britton.disted.camosun.bc.ca/modart/jbmodart.htm
- web.archive.org/web/20160220061222/http:/mersennewiki.org/index.php/Modular_arithmetic
- www.britannica.com/EBchecked/topic/920687/modular-arithmetic
- www.cut-the-knot.org/blue/Modulo.shtml
- Link from a Wikipage to another Wikipage
- 12-hour clock
- 24-hour clock
- Abstract algebra
- Addition
- Advanced Encryption Standard
- Apportionment (politics)
- Arithmetic
- Bézout's identity
- Bitwise operation
- Boolean ring
- Brute force search
- Calculator
- Carl Friedrich Gauss
- Carmichael function
- CAS registry number
- Casting out nines
- Category:Articles with example C code
- Category:Finite rings
- Category:Group theory
- Category:Modular arithmetic
- CDC 6600
- Characteristic (algebra)
- Charles E. Leiserson
- Check digit
- Chemistry
- Chinese remainder theorem
- Circular buffer
- Clifford Stein
- Commutative ring
- Computer algebra
- Computer science
- Congruence relation
- Coprime
- Coprime integers
- Coset
- Cryptography
- Cyclic group
- D. C. Heath and Company
- Data structure
- Diffie–Hellman key exchange
- Discrete logarithm
- Disquisitiones Arithmeticae
- Division (mathematics)
- Divisor
- Doomsday algorithm
- Economics
- Elliptic curve
- Empty set
- Encryption
- Encyclopædia Britannica
- Enharmonic
- Equivalence class
- Equivalence relation
- Euclidean division
- Euler's criterion
- Euler's sum of powers conjecture
- Euler's theorem
- Euler's totient function
- Extended Euclidean algorithm
- Extended precision
- Fermat's little theorem
- Fidonet
- Field (mathematics)
- File:Clock group.svg
- Finite field
- Flat (music)
- Floating-point
- Game theory
- Gaussian elimination
- Gröbner basis
- Group (mathematics)
- Group theory
- Integer
- Integer factorization
- International Bank Account Number
- International Data Encryption Algorithm
- International Standard Book Number
- Introduction to Algorithms
- Isomorphism
- Knot theory
- Lagrange's theorem (group theory)
- Lagrange's theorem (number theory)
- Law
- Legendre symbol
- Linear algebra
- Linear congruence theorem
- Long double
- Mathematics
- Maximal ideal
- Microcomputer
- Modular exponentiation
- Modular multiplicative inverse
- Modulo (mathematics)
- Modulo operation
- Montgomery reduction
- Multiplication
- Multiplicative group
- Multiplicative group of integers modulo n
- Music
- NP-complete
- NP-intermediate
- Number theory
- Octave
- P-adic
- Pisano period
- Polynomial
- Polynomial factorization
- Polynomial greatest common divisor
- Polynomial time
- Prentice Hall
- Prime
- Prime power
- Primitive root modulo n
- Programming language
- Proportional (fair division)
- Public-key cryptography
- Quadratic congruences
- Quadratic reciprocity
- Quadratic residue
- Quotient group
- Quotient ring
- Rational reconstruction (mathematics)
- RC4
- Reduced residue system
- Representative (mathematics)
- Ring (mathematics)
- Ring ideal
- Ring theory
- Ronald L. Rivest
- Rosetta Code
- RSA (algorithm)
- Serial number arithmetic
- Sharp (music)
- Sinclair QL
- Singleton set
- Social science
- Subtraction
- Supercomputer
- Symmetric key algorithm
- Thomas H. Cormen
- Thue's lemma
- Twelve-tone equal temperament
- Two-element Boolean algebra
- Visual arts
- Wilson's theorem
- XOR
- Zeller's congruence
- Zero-divisor
- SameAs
- 2xS8j
- Arithmetica modularis
- Arithmétique modulaire
- Aritmetega modulara
- Aritmética modular
- Aritmética modular
- Aritmética modular
- Aritmética modular
- Aritmètica modular
- Aritmetica modulare
- Aritmetika modular
- Aritmetika modular
- Aritmetika modulare
- Arytmetyka modularna
- m.051f3
- Maradékosztály
- Mátreikningur
- Modulaarinen aritmetiikka
- Modula aritmetiko
- Modulær aritmetikk
- Modulair rekenen
- Modular arithmetic
- Modular arithmetic
- Modulär aritmetik
- Modularna aritmetika
- Modularna aritmetika
- Modularna aritmetika
- Modulárna aritmetika
- Modulární aritmetika
- Modüler aritmetik
- Q319400
- Số học mô đun
- Αριθμητική υπολοίπων
- Модуларна аритметика
- Модуларна аритметика
- Модуле буйынса сағыштырыу
- Модульна арифметика
- Модульная арифметика
- חשבון מודולרי
- بمعامل
- حسابيات معيارية
- همنهشتی (نظریه اعداد)
- پێوەری ژمارە زانین
- मॉड्युलर गणित
- মডুলার পাটীগণিত
- சமானம், மாடுலோ n
- മോഡ്യുലർ അങ്കഗണിതം
- เลขคณิตมอดุลาร์
- 合同算術
- 模算數
- 모듈러 산술
- SeeAlso
- Modulo operation
- Subject
- Category:Articles with example C code
- Category:Finite rings
- Category:Group theory
- Category:Modular arithmetic
- Thumbnail
- Title
- enCongruence
- WasDerivedFrom
- Modular arithmetic?oldid=1120780300&ns=0
- WikiPageLength
- 29395
- Wikipage page ID
- 20087
- Wikipage revision ID
- 1120780300
- WikiPageUsesTemplate
- Template:=
- Template:About
- Template:Anchor
- Template:Apostol IANT
- Template:Citation needed
- Template:Cite book
- Template:Div col
- Template:Div col end
- Template:Empty section
- Template:Isbn
- Template:Main
- Template:Math
- Template:Mvar
- Template:Number theory
- Template:Original research
- Template:Overline
- Template:Reflist
- Template:Section link
- Template:See also
- Template:Short description
- Template:Springer
- Template:Sub
