Asked by Samantha
Let a, b, c, and d be integers, and let n be a positive integer. Prove that if a is congruent to c mod n and b is congruent to d mod n, then (a-b) is congruent to (c-d) mod n
Answers
Answered by
MathMate
Given:
a≡c mod n
b≡d mod n
Prove that (a-c)≡(b-d) mod n.
Let
a=kn+r ... k,r ∈ ℤ<sup>+</sup>
c=ln+r ... l,r ∈ ℤ<sup>+</sup>
Subtract:
(a-c)=(k-l)n
Similarly,
(b-d)=(p-q)n ... p,q ∈ ℤ<sup>+</sup>
Therefore
(a-c)≡(b-d) mod n
a≡c mod n
b≡d mod n
Prove that (a-c)≡(b-d) mod n.
Let
a=kn+r ... k,r ∈ ℤ<sup>+</sup>
c=ln+r ... l,r ∈ ℤ<sup>+</sup>
Subtract:
(a-c)=(k-l)n
Similarly,
(b-d)=(p-q)n ... p,q ∈ ℤ<sup>+</sup>
Therefore
(a-c)≡(b-d) mod n
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.