Mathematical-Reasoning · Unit 29 · Video 1 · Interactive Practice
| Formula | Meaning |
|---|---|
| membership in a congruence class modulo | |
| congruence arithmetic (proved earlier): the remainder depends only on the classes | |
| , | the remainder of on division by , from |
| a number and its digit sum leave the same remainder — observed here, proved in the last video |
Key Insight: A remainder lies between and : , so leaves remainder on division by , not .
The remainders of , and modulo depend only on the classes of and .
For every test number, and its digit sum leave the same remainder on division by .
💡 Six matching rows are evidence, not a proof; the last video of this unit proves for every natural number .
Problem 1 · Remainders From the Classes
Suppose and .
What remainder does leave on division by ?
What remainder does leave on division by ?
Since and , congruence arithmetic gives
Check with members: , give (remainder ) and (remainder ).
Problem 2 · The Remainder of a Negative Integer
What is the remainder when is divided by ?
The Division Algorithm needs with . The largest multiple of not above is , so
Check: , so and .
Problem 3 · Two Remainders Modulo 9
Let . Using , find the remainder of on division by .
, so and
The digit sum is , which also leaves remainder .
Problem 4 · A Polynomial in x Modulo 6
Suppose . What remainder does leave on division by ?
From , congruence arithmetic gives and then . Since ,
Check with : . In fact is always even, and here it is a multiple of as well.
Solved: 0 / 4