Mathematical-Reasoning ยท Unit 27 ยท Video 2 ยท Interactive Practice

Congruence Modulo n as a Symmetric Relation

IKey Formulas

StatementEquivalent forms
xโ‰กy(modn)x \equiv y \pmod{n}nโˆฃ(xโˆ’y)n \mid (x - y) โ€…โ€ŠโŸบโ€…โ€Š\iff xโˆ’y=nkx - y = nk for some kโˆˆZk \in \mathbb{Z} โ€…โ€ŠโŸบโ€…โ€Š\iff x=y+nkx = y + nk for some kโˆˆZk \in \mathbb{Z}
Congruence modulo nn as a set{(x,y)โˆˆZร—Zโˆฃxโ‰กy(modn)}โІZร—Z\{ (x, y) \in \mathbb{Z} \times \mathbb{Z} \mid x \equiv y \pmod{n} \} \subseteq \mathbb{Z} \times \mathbb{Z}, a relation on Z\mathbb{Z}
Properties theoremreflexive on Z\mathbb{Z}, symmetric and transitive
Remainder factif x=nq+rx = nq + r with 0โ‰คr<n0 \le r \lt n, then xโ‰กr(modn)x \equiv r \pmod{n}

Key Insight: Symmetry takes one move: multiply xโˆ’y=nkx - y = nk by โˆ’1-1 to get yโˆ’x=n(โˆ’k)y - x = n(-k), and โˆ’k-k is an integer.

IIThe Relation as a Set of Pairs

Each pair (x,y)(x, y) with nโˆฃ(xโˆ’y)n \mid (x - y) is a filled cell; symmetry is the mirror across the diagonal.

IIIThe Know-Show Table for Symmetry

Work backward from the goal, forward from the hypothesis, and the integer m=โˆ’km = -k connects them.

StepKnowReasonThis example
PPxโ‰กy(modn)x \equiv y \pmod{n}hypothesis
P1P1nโˆฃ(xโˆ’y)n \mid (x - y)definition of congruence
P2P2xโˆ’y=nkx - y = nk for some kโˆˆZk \in \mathbb{Z}definition of divides
P3P3yโˆ’x=n(โˆ’k)y - x = n(-k), and โˆ’kโˆˆZ-k \in \mathbb{Z}multiply P2P2 by โˆ’1-1
Q2Q2yโˆ’x=nmy - x = nm for some mโˆˆZm \in \mathbb{Z}take m=โˆ’km = -k
Q1Q1nโˆฃ(yโˆ’x)n \mid (y - x)definition of divides
QQyโ‰กx(modn)y \equiv x \pmod{n}definition of congruence

IVQuiz Questions

Problem 1 ยท Which Pair Is in the Relation?

Given: congruence modulo 66 as a relation on Z\mathbb{Z}. Which pair belongs to it?

โœ… Correct! 20โˆ’2=18=6โ‹…320 - 2 = 18 = 6 \cdot 3, so 20โ‰ก2(mod6)20 \equiv 2 \pmod{6}.
โŒ Not quite. 20โˆ’4=1620 - 4 = 16, and 1616 is not a multiple of 66.
โŒ Not quite. 9โˆ’(โˆ’4)=139 - (-4) = 13, not a multiple of 66. (The sum 9+(โˆ’4)=59 + (-4) = 5 is not what congruence tests.)
โŒ Not quite. 66 is divisible by 66, but congruence tests the difference: 6โˆ’1=56 - 1 = 5.
โŒ Not quite. Test whether 66 divides xโˆ’yx - y.
Show solution

A pair (x,y)(x, y) is in the relation exactly when 6โˆฃ(xโˆ’y)6 \mid (x - y):

  • (20,4)(20, 4): 20โˆ’4=1620 - 4 = 16, not a multiple of 66.
  • (20,2)(20, 2): 20โˆ’2=18=6โ‹…320 - 2 = 18 = 6 \cdot 3, so it is in the relation.
  • (9,โˆ’4)(9, -4): 9โˆ’(โˆ’4)=139 - (-4) = 13, not a multiple of 66.
  • (6,1)(6, 1): 6โˆ’1=56 - 1 = 5, not a multiple of 66.

Problem 2 ยท Same Pair, Different Moduli

Given: the pair (23,8)(23, 8). Which statement is true?

โœ… Correct! 23โˆ’8=15=3โ‹…523 - 8 = 15 = 3 \cdot 5. The pair is in congruence modulo nn exactly for the divisors n=1,3,5,15n = 1, 3, 5, 15 of 1515.
โŒ Not quite. 1515 is not a multiple of 44, so (23,8)(23, 8) drops out of congruence modulo 44.
โŒ Not quite. 1515 is odd, so 2โˆค152 \nmid 15.
โŒ Not quite. 15=6โ‹…2+315 = 6 \cdot 2 + 3, so 6โˆค156 \nmid 15.
โŒ Not quite. Compute 23โˆ’823 - 8 and test each modulus.
Show solution

23โ‰ก8(modn)23 \equiv 8 \pmod{n} means nโˆฃ(23โˆ’8)=15n \mid (23 - 8) = 15. The natural numbers dividing 1515 are 1,3,5,151, 3, 5, 15. Of the four moduli offered, only 33 divides 1515: 15=3โ‹…515 = 3 \cdot 5.

So each natural number nn gives its own relation, and the same pair can belong to one and not to another.

Problem 3 ยท The Missing Integer

Given: in the proof that congruence modulo nn is symmetric, we know xโˆ’y=nkx - y = nk for an integer kk, and we must find an integer mm with yโˆ’x=nmy - x = nm. Which mm works?

โœ… Correct! yโˆ’x=โˆ’(xโˆ’y)=โˆ’(nk)=n(โˆ’k)y - x = -(x - y) = -(nk) = n(-k), and โˆ’kโˆˆZ-k \in \mathbb{Z}.
โŒ Not quite. yโˆ’xy - x is the negative of xโˆ’yx - y, so m=km = k works only when k=0k = 0.
โŒ Not quite. 1k\tfrac{1}{k} is usually not an integer (and is undefined for k=0k = 0); the definition of divides needs an integer.
โŒ Not quite. n(kโˆ’n)=nkโˆ’n2n(k - n) = nk - n^2, which is not โˆ’(nk)-(nk) in general.
โŒ Not quite. Multiply xโˆ’y=nkx - y = nk by โˆ’1-1.
Show solution

Multiply both sides of xโˆ’y=nkx - y = nk by โˆ’1-1:

yโˆ’x=โˆ’(xโˆ’y)=โˆ’nk=n(โˆ’k).y - x = -(x - y) = -nk = n(-k).

Since kk is an integer, so is โˆ’k-k. Taking m=โˆ’km = -k gives yโˆ’x=nmy - x = nm with mโˆˆZm \in \mathbb{Z}, so nโˆฃ(yโˆ’x)n \mid (y - x) and yโ‰กx(modn)y \equiv x \pmod{n}.

Problem 4 ยท A New Relation, the Same Plan

Given: the relation RR on Z\mathbb{Z} with xRyx \mathrel{R} y if and only if 3โˆฃ(2x+y)3 \mid (2x + y). Is RR symmetric?

โœ… Correct! 2y+x=3x+3yโˆ’(2x+y)=3(x+y)โˆ’3k2y + x = 3x + 3y - (2x + y) = 3(x + y) - 3k, and x+yโˆ’kx + y - k is an integer.
โŒ Not quite. The conclusion is right but the reason is false: with x=1x = 1, y=0y = 0 the two expressions are 22 and 11.
โŒ Not quite. Two different expressions can both be multiples of 33. Symmetry needs 3โˆฃ(2y+x)3 \mid (2y + x), not 2y+x=2x+y2y + x = 2x + y.
โŒ Not quite. 2โ‹…3+0=6=3โ‹…22 \cdot 3 + 0 = 6 = 3 \cdot 2, so (3,0)โˆˆR(3, 0) \in R as well.
โŒ Not quite. Assume 2x+y=3k2x + y = 3k and look for an integer mm with 2y+x=3m2y + x = 3m.
Show solution

Know: xRyx \mathrel{R} y, so 2x+y=3k2x + y = 3k for some kโˆˆZk \in \mathbb{Z}. Show: yRxy \mathrel{R} x, that is, 2y+x=3m2y + x = 3m for some mโˆˆZm \in \mathbb{Z}.

Write 2y+x2y + x in terms of 2x+y2x + y:

2y+x=3x+3yโˆ’(2x+y)=3x+3yโˆ’3k=3(x+yโˆ’k).2y + x = 3x + 3y - (2x + y) = 3x + 3y - 3k = 3(x + y - k).

Since x+yโˆ’kx + y - k is an integer, 3โˆฃ(2y+x)3 \mid (2y + x) and yRxy \mathrel{R} x. So RR is symmetric.

Solved: 0 / 4