Mathematical-Reasoning ยท Unit 27 ยท Video 2 ยท Interactive Practice
| Statement | Equivalent forms |
|---|---|
| for some for some | |
| Congruence modulo as a set | , a relation on |
| Properties theorem | reflexive on , symmetric and transitive |
| Remainder fact | if with , then |
Key Insight: Symmetry takes one move: multiply by to get , and is an integer.
Each pair with is a filled cell; symmetry is the mirror across the diagonal.
Work backward from the goal, forward from the hypothesis, and the integer connects them.
| Step | Know | Reason | This example |
|---|---|---|---|
| hypothesis | |||
| definition of congruence | |||
| for some | definition of divides | ||
| , and | multiply by | ||
| for some | take | ||
| definition of divides | |||
| definition of congruence |
Problem 1 ยท Which Pair Is in the Relation?
Given: congruence modulo as a relation on . Which pair belongs to it?
A pair is in the relation exactly when :
Problem 2 ยท Same Pair, Different Moduli
Given: the pair . Which statement is true?
means . The natural numbers dividing are . Of the four moduli offered, only divides : .
So each natural number 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 is symmetric, we know for an integer , and we must find an integer with . Which works?
Multiply both sides of by :
Since is an integer, so is . Taking gives with , so and .
Problem 4 ยท A New Relation, the Same Plan
Given: the relation on with if and only if . Is symmetric?
Know: , so for some . Show: , that is, for some .
Write in terms of :
Since is an integer, and . So is symmetric.
Solved: 0 / 4