Loading [MathJax]/extensions/TeX/boldsymbol.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
    • Number of Print Columns
  • Include attachments
Searching in
About 1 results
  • https://math.libretexts.org/Courses/Mount_Royal_University/Higher_Arithmetic/3%3A_Modular_Arithmetic/3.1%3A_Modulo_Operation
    a is congruent to b modulo m denoted as a \equiv b (mod \, n) , if a and b have the remainder when they are divided by n, for a, b \in \mathbb{Z}. Two integers a ...a is congruent to b modulo m denoted as a \equiv b (mod \, n) , if a and b have the remainder when they are divided by n, for a, b \in \mathbb{Z}. Two integers a and b are said to be congruent modulo n, a \equiv b (mod \, n), if all of the following are true: Proof: Let a, b \in \mathbb{Z} such that a \equiv b (mod n). Proof: Let a, b, c \in \mathbb{Z}, such that a \equiv b (mod n) and b \equiv c (mod n).

Support Center

How can we help?