Number System

Modular Congruence

Two tokens complete different numbers of turns and land together.

Modular Congruence definition

Integers a and b are congruent modulo m if m divides a − b.

In Spanish
congruencia modular
Topic
Number theory

Modular Congruence in a picture

Modular Congruence diagramTwo numbers that differ by complete cycles land on the same position.17 − 2 = 15Compare the difference15 = 5 × 3The modulus divides it17 ≡ 2 (mod 5)Same residue
Two numbers that differ by complete cycles land on the same position.

How it works

Write a ≡ b (mod m). Equivalently, a and b have the same remainder modulo m. For example, 17 ≡ 2 (mod 5) because 17 − 2 = 15. Congruence is preserved when you add, subtract, or multiply congruent representatives using the same modulus.

Worked examples

Are 13 and 1 congruent modulo 4?

Yes. Their difference is 12, a multiple of 4.

Are 10 and 4 congruent modulo 5?

No. Their difference is 6.

Find b from 0 to 6 such that −2 ≡ b (mod 7).

b = 5.

Common mistake

Check the modulus. Numbers can be congruent for one modulus and fail for another.

Quick check

What must divide a − b?

Show answer

The modulus m.

Are 3 and 8 congruent modulo 5?

Show answer

Yes.

Are they congruent modulo 2?

Show answer

No. Their difference is 5.

Sources

Flashcard

Modular Congruence

Reveal the definition

Integers a and b are congruent modulo m if m divides a − b.

Effortless Math. “Modular Congruence.” Math Dictionary.