Mathematical-Reasoning · Unit 29 · Video 1 · Interactive Practice

Remainders of Sums, Products and Digit Sums Mod 6 and Mod 9

IKey Formulas

FormulaMeaning
x∈[3]  ⟺  x≡3(mod6)  ⟺  6∣(x−3)x \in [3] \iff x \equiv 3 \pmod 6 \iff 6 \mid (x - 3)membership in a congruence class modulo 66
x≡a, y≡b(modn) ⇒ x+y≡a+b,  xy≡ab,  x2≡a2(modn)x \equiv a,\ y \equiv b \pmod n \ \Rightarrow\ x + y \equiv a + b,\ \ xy \equiv ab,\ \ x^2 \equiv a^2 \pmod ncongruence arithmetic (proved earlier): the remainder depends only on the classes
r=n−9⋅int⁡(n/9)r = n - 9 \cdot \operatorname{int}(n/9),  0≤r<9\ 0 \le r < 9the remainder of nn on division by 99, from n=9q+rn = 9q + r
n≡s(n)(mod9)n \equiv s(n) \pmod 9a number and its digit sum leave the same remainder — observed here, proved in the last video

Key Insight: A remainder lies between 00 and n−1n - 1: −5=6⋅(−1)+1-5 = 6 \cdot (-1) + 1, so −5-5 leaves remainder 11 on division by 66, not −5-5.

IIAny Members, Same Remainders

The remainders of x+yx + y, xyxy and x2x^2 modulo 66 depend only on the classes of xx and yy.

IIIA Number and Its Digit Sum Modulo 9

For every test number, nn and its digit sum s(n)s(n) leave the same remainder on division by 99.

💡 Six matching rows are evidence, not a proof; the last video of this unit proves n≡s(n)(mod9)n \equiv s(n) \pmod 9 for every natural number nn.

IVQuiz Questions

Problem 1 · Remainders From the Classes

Suppose x≡4(mod6)x \equiv 4 \pmod 6 and y≡5(mod6)y \equiv 5 \pmod 6.

What remainder does x+yx + y leave on division by 66?

What remainder does xyxy leave on division by 66?

✅ Correct! 4+5=9=6⋅1+34 + 5 = 9 = 6 \cdot 1 + 3 and 4⋅5=20=6⋅3+24 \cdot 5 = 20 = 6 \cdot 3 + 2, whichever xx and yy were chosen.
❌ Not quite. 99 is not a remainder on division by 66: it must lie between 00 and 55. Reduce 9=6⋅1+39 = 6 \cdot 1 + 3.
❌ Not quite. 2020 is 4⋅54 \cdot 5, but a remainder on division by 66 lies between 00 and 55.
❌ Check the sum. By congruence arithmetic x+y≡4+5(mod6)x + y \equiv 4 + 5 \pmod 6; reduce 99.
❌ Check the product. By congruence arithmetic xy≡4⋅5(mod6)xy \equiv 4 \cdot 5 \pmod 6; reduce 2020.
Show solution

Since x≡4x \equiv 4 and y≡5(mod6)y \equiv 5 \pmod 6, congruence arithmetic gives

x+y≡4+5=9=6⋅1+3≡3(mod6),xy≡4⋅5=20=6⋅3+2≡2(mod6).x + y \equiv 4 + 5 = 9 = 6 \cdot 1 + 3 \equiv 3 \pmod 6, \qquad xy \equiv 4 \cdot 5 = 20 = 6 \cdot 3 + 2 \equiv 2 \pmod 6.

Check with members: x=10x = 10, y=−1y = -1 give x+y=9x + y = 9 (remainder 33) and xy=−10=6⋅(−2)+2xy = -10 = 6 \cdot (-2) + 2 (remainder 22).

Problem 2 · The Remainder of a Negative Integer

What is the remainder when −23-23 is divided by 66?

✅ Correct! −23=6⋅(−4)+1-23 = 6 \cdot (-4) + 1 with 0≤1<60 \le 1 < 6.
❌ Not quite. −23=6⋅(−3)−5-23 = 6 \cdot (-3) - 5 is true, but a remainder must satisfy 0≤r<60 \le r < 6; go one more multiple of 66 down.
❌ Not quite. 55 is the remainder of 2323. Check: −23−5=−28-23 - 5 = -28 is not a multiple of 66.
❌ Not quite. Find the integer qq with 6q≤−23<6q+66q \le -23 < 6q + 6.
Show solution

The Division Algorithm needs −23=6q+r-23 = 6q + r with 0≤r<60 \le r < 6. The largest multiple of 66 not above −23-23 is 6⋅(−4)=−246 \cdot (-4) = -24, so

−23=6⋅(−4)+1,r=1.-23 = 6 \cdot (-4) + 1, \qquad r = 1.

Check: −23−1=−24=6⋅(−4)-23 - 1 = -24 = 6 \cdot (-4), so −23≡1(mod6)-23 \equiv 1 \pmod 6 and −23∈[1]-23 \in [1].

Problem 3 · Two Remainders Modulo 9

Let n=8642n = 8642. Using r=n−9⋅int⁡(n/9)r = n - 9 \cdot \operatorname{int}(n/9), find the remainder of nn on division by 99.

✅ Correct! 8642=9⋅960+28642 = 9 \cdot 960 + 2, and the digit sum 20=9⋅2+220 = 9 \cdot 2 + 2 leaves the same remainder.
❌ Not quite. 2020 is the digit sum s(8642)s(8642), and it is larger than 88, so it is not a remainder. What matches is the remainder it leaves.
❌ Not quite. 960=int⁡(8642/9)960 = \operatorname{int}(8642/9) is the quotient qq, not the remainder.
❌ Not quite. Compute 9⋅9609 \cdot 960 and subtract it from 86428642.
Show solution

8642/9≈960.28642 / 9 \approx 960.2, so int⁡(8642/9)=960\operatorname{int}(8642/9) = 960 and

r=8642−9⋅960=8642−8640=2.r = 8642 - 9 \cdot 960 = 8642 - 8640 = 2.

The digit sum is s(8642)=8+6+4+2=20=9⋅2+2s(8642) = 8 + 6 + 4 + 2 = 20 = 9 \cdot 2 + 2, which also leaves remainder 22.

Problem 4 · A Polynomial in x Modulo 6

Suppose x≡5(mod6)x \equiv 5 \pmod 6. What remainder does x2+xx^2 + x leave on division by 66?

✅ Correct! x2+x≡25+5=30=6⋅5(mod6)x^2 + x \equiv 25 + 5 = 30 = 6 \cdot 5 \pmod 6.
❌ Not quite. 3030 is 52+55^2 + 5, but a remainder on division by 66 lies between 00 and 55.
❌ Not quite. x2≡25≡1x^2 \equiv 25 \equiv 1, but the expression also has the term x≡5x \equiv 5; add them: 1+5=61 + 5 = 6.
❌ Not quite. Replace xx by 55 in x2+xx^2 + x, then reduce modulo 66.
Show solution

From x≡5(mod6)x \equiv 5 \pmod 6, congruence arithmetic gives x2≡52=25(mod6)x^2 \equiv 5^2 = 25 \pmod 6 and then x2+x≡25+5=30(mod6)x^2 + x \equiv 25 + 5 = 30 \pmod 6. Since 30=6⋅5+030 = 6 \cdot 5 + 0,

x2+x≡0(mod6).x^2 + x \equiv 0 \pmod 6.

Check with x=−1∈[5]x = -1 \in [5]: (−1)2+(−1)=0(-1)^2 + (-1) = 0. In fact x2+x=x(x+1)x^2 + x = x(x + 1) is always even, and here it is a multiple of 33 as well.

Solved: 0 / 4