Skip to content

FOLLOW AN IDEA

Modular arithmetic

Congruence identifies integers with the same remainder modulo a positive integer.

Explore concept graph · Explore connected videos

Different ways to understand it

No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video

More concepts to explore

  • Cryptographic security models

    Security depends on defined adversary capabilities, assumptions and failure probability.

  • Euclidean algorithm

    The Euclidean algorithm computes a greatest common divisor by repeated division with remainder. Replacing (a,b) by (b,r) preserves the common divisors, and the strictly smaller nonnegative remainders force termination.

  • Fermat and Euler theorems

    Coprime residues satisfy power congruences controlled by prime moduli or Euler's totient.

  • Groups

    A group has an associative operation, an identity and an inverse for every element.

  • Modular inverses

    An integer has an inverse modulo n exactly when it is coprime to n.

Back to the complete concept index →

Knowledge connections

Appears in these maps

LEARNING MAP

Cryptography

Explore arithmetic and security models; encryption and authentication; groups, signatures and hashes. Concepts and connections are available independently of video coverage.

LEARNING MAP

Discrete Mathematics: Counting and Number Theory

Connect functions and counting with elementary number theory, graph structures and algorithmic reasoning. Shared concepts and reviewed map connections organize the path; video explanations are added as resources pass review.

LEARNING MAP

Number Theory

Explore divisibility and congruences; arithmetic functions and equations; prime distribution and advanced connections. Concepts and connections are available independently of video coverage.

Scope reference