✔ https://StudyForce.com
✔ https://Biology-Forums.com
✔ Ask questions here: https://Biology-Forums.com/Ask
Q1. Prove that 7 is congruent to 9 modulo 2.
Definition: Let m be a positive integer and let a,b∈Z. The phrase "a is congruent to b modulo m" means that m | (a−b). We use the notation a≡b (mod m) to indicate that a is congruent to b modulo m.
Q2. Find the value of x such that x ≡ 3 (mod 6).
Q3. What are all the possible remainders of mod 5?
