55 776
Assignments Done
97,2%
Successfully Done
In December 2017
Your physics homework can be a real challenge, and the due date can be really close — feel free to use our assistance and get the desired result.
Be sure that math assignments completed by our experts will be error-free and done according to your instructions specified in the submitted order form.
Our experts will gladly share their knowledge and help you with programming homework. Keep up with the world’s newest programming trends.

Answer on Combinatorics | Number Theory Question for Niren gupta

Question #5300
prove the relation a=L(mod m) is aequivalent relation?

Expert's answer
to prove we must
show that this relation is reflexive, symmetric and transitive
reflexive:
a=a( mod m) it is obvious statement by the definition of mod m
symmetric if
a=b(mod m) then b=a (mod m) to prove this we can write if a=b(mod m) then a have
the same remainder after division by m as b. so b have the same remainder after
division by m as a so b=a(mod m)
transitive: if a=b(mod m) and b=c(mod m)
then a=c(mod m) . if a=b (mod m) so a have reminder after division by m and its
equal to the same remainder of b , from b=c(mod m) we have that b have reminder
after division by m and its equal to the same remainder of c. so a and c have
the same remainder . so a=c(mod m)

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question