Modular Arithmetic: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

18 April 2026

  • curprev 04:1004:10, 18 April 2026 Iwiseman talk contribs 1,059 bytes +1,059 Created page with "=Introduction= Modular arithmetic is a system of arithmetic for integers where the numbers wrap around when they reach a certain value. A good example is a clock. Once 12 is reached, the count resets. So given the set {0,1,2,3,4,5,6,7,8,9,10,11}, when 11 o'clock is reached we wrap back to 0. =Modulus= This is the *remainder* of a division. For example: 5 mod 3 means “what is left over when 5 is divided by 3?” 5 = 3 × 1 + 2 So 5 mod 3 = 2. The quotient (how..."
Retrieved from "https://wiki.bibble.co.nz/Modular_Arithmetic"