Find three different ways to symbolically represent the set of all integers $a$
such that
is divisible by .
List 5 elements in the following congruence class, including atleast
2 positive and 2 negative:
Calculate the following, and reduce the solution to standard form.
For the following equation, find a congruence class (in standard form) that solves the equation. There may be more than one solution.
For the following equation, find a congruence class (in standard form) that solves the equation if possible.