enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Modular arithmetic - Wikipedia

    en.wikipedia.org/wiki/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.

  3. Residue number system - Wikipedia

    en.wikipedia.org/wiki/Residue_number_system

    A residue numeral system (RNS) is a numeral system representing integers by their values modulo several pairwise coprime integers called the moduli. This representation is allowed by the Chinese remainder theorem, which asserts that, if M is the product of the moduli, there is, in an interval of length M, exactly one integer having any given set of modular values.

  4. Multiplicative group of integers modulo n - Wikipedia

    en.wikipedia.org/wiki/Multiplicative_group_of...

    In modular arithmetic, the integers coprime (relatively prime) to n from the set {,, …,} of n non-negative integers form a group under multiplication modulo n, called the multiplicative group of integers modulo n.

  5. Primitive root modulo n - Wikipedia

    en.wikipedia.org/wiki/Primitive_root_modulo_n

    In modular arithmetic, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n if for every integer a coprime to n, there is some integer k for which g k ≡ a (mod n). Such a value k is called the index or discrete logarithm of a to the base g modulo n.

  6. Multiplicative order - Wikipedia

    en.wikipedia.org/wiki/Multiplicative_order

    In number theory, given a positive integer n and an integer a coprime to n, the multiplicative order of a modulo n is the smallest positive integer k such that (). [1]In other words, the multiplicative order of a modulo n is the order of a in the multiplicative group of the units in the ring of the integers modulo n.

  7. Root of unity modulo n - Wikipedia

    en.wikipedia.org/wiki/Root_of_unity_modulo_n

    A simple way to find such an n is to check for primitive kth roots with respect to the moduli in the arithmetic progression +, +, +, … All of these moduli are coprime to k and thus k is a unit. According to Dirichlet's theorem on arithmetic progressions there are infinitely many primes in the progression, and for a prime p {\displaystyle p ...

  8. Modulus - Wikipedia

    en.wikipedia.org/wiki/Modulus

    Modulus (modular arithmetic), base of modular arithmetic; Modulus, the absolute value of a real or complex number ( | a |) Moduli space, in mathematics a geometric space whose points represent algebro-geometric objects; Conformal modulus, a measure of the size of a curve family; Modulus of continuity, a function gauging the uniform continuity ...

  9. Modulo (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Modulo_(mathematics)

    Modulo is a mathematical jargon that was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. [3] Given the integers a, b and n, the expression "a ≡ b (mod n)", pronounced "a is congruent to b modulo n", means that a − b is an integer multiple of n, or equivalently, a and b both share the same remainder when divided by n.