Modularkongruenz

Modularkongruenz, often referred to as congruence modulo n, is a fundamental concept in number theory that describes a relationship between integers. Two integers, a and b, are said to be congruent modulo n, where n is a positive integer, if their difference (a - b) is an integer multiple of n. This relationship is typically denoted by the symbol "≡", so we write a ≡ b (mod n). Alternatively, this means that a and b leave the same remainder when divided by n. The integer n is called the modulus.

For example, 17 is congruent to 5 modulo 12, written as 17 ≡ 5 (mod 12), because 17 - 5 = 12, which is a multiple of 12. Also, both 17 and 5 leave a remainder of 5 when divided by 12. This concept is crucial in various branches of mathematics, including cryptography, abstract algebra, and computer science. It allows mathematicians to simplify complex problems by working with remainders instead of the actual numbers. Properties of modular arithmetic include reflexivity (a ≡ a (mod n)), symmetry (if a ≡ b (mod n), then b ≡ a (mod n)), and transitivity (if a ≡ b (mod n) and b ≡ c (mod n), then a ≡ c (mod n)).