Skip to main content

Beginning Activity Beginning Activity 2: Review of Congruence Modulo \(\boldsymbol{n}\)

1.

Let \(a, b \in \mathbb{Z}\) and let \(n \in \mathbb{N}\text{.}\) On Definition of Section 3.1, we defined what it means to say that \(a\) is congruent to \(b\) modulo \(n\text{.}\) Write this definition and state two different conditions that are equivalent to the definition.

2.

Explain why congruence modulo \(n\) is a relation on \(\mathbb{Z}\text{.}\)

5.

Write a proof of the symmetric property for congruence modulo \(n\text{.}\) That is, prove the following:

Let \(a, b \in \mathbb{Z}\) and let \(n \in \mathbb{N}\text{.}\) If \(a \equiv b \pmod n\text{,}\) then \(b \equiv a \pmod n\text{.}\)