skip to main content
LOTERRE

LOTERRE

Search from vocabulary

Content language

| español français
Search help

Concept information

Preferred term

congruence  

Definition(s)

  • Given an integer n > 1, called a modulus, two integers a and b are said to be congruent modulo n, if n is a divisor of their difference: that is, if there is an integer k such that:
    Congruence modulo n is a congruence relation, meaning that it is an equivalence relation that is compatible with the operations of addition, subtraction, and multiplication. Congruence modulo n is denoted:
    The parentheses mean that (mod n) applies to the entire equation, not just to the right-hand side (here, b).
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Modular_arithmetic#Congruence)

Broader concept(s)

In other languages

URI

http://data.loterre.fr/ark:/67375/PSR-Q3G3SRHB-H

Download this concept:

RDF/XML TURTLE JSON-LD Last modified 10/12/23