Linear conqruence and relations problem

[mehdi98]

Suppose that the relation R is defined on the set Z where aRb means a = ±b. Establish whether R is an equivalence relation giving your justifications.

Find the set of solutions of each of the linear congruence:
a) x ≡ 3 (mod 5).
b) 2x ≡ 5 (mod 9).(please write the full solutions thanks)

 

[Evgeny.Makarov]

Suppose that the relation R is defined on the set Z where aRb means a = ±b. Establish whether R is an equivalence relation giving your justifications.

R is an equivalence relation if R is reflexive, symmetric and transitive. The fact that R is symmetric means $\forall x,y\in\mathbb{Z}\,(x,y)\in R\implies (y,x)\in R$. For this definition of $R$ this means that whenever $x=\pm y$, we also have $y=\pm x$. Do you think this is true?

a) x ≡ 3 (mod 5).

It's easy to see that 3, 8, 13, 18, ... give 3 as a remainder when divided by 5. Therefore, solutions are $3+5k$, $k\in\mathbb{Z}$.

b) 2x ≡ 5 (mod 9).

We need to divide both sides by 2. Note that 2 has an inverse modulo 9, i.e., there exists a number $y$ such that $2y$ gives the remainder 1 when divided by 9. Then $2xy\equiv x(2y)\equiv x\equiv 5y\pmod{9}$.

For the future, please read the http://mathhelpboards.com/rules/, especially rules 8 and 11.

 

[mehdi98]

thank you:D and sorry