Posted by **Samantha** on Saturday, December 4, 2010 at 3:21pm.

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

- Discrete Math -
**MathMate**, Saturday, December 4, 2010 at 7:45pm
Given:

a≡c mod n

b≡d mod n

Prove that (a-c)≡(b-d) mod n.

Let

a=kn+r ... k,r ∈ ℤ^{+}

c=ln+r ... l,r ∈ ℤ^{+}

Subtract:

(a-c)=(k-l)n

Similarly,

(b-d)=(p-q)n ... p,q ∈ ℤ^{+}

Therefore

(a-c)≡(b-d) mod n

## Answer this Question

## Related Questions

- another college math question - Please teach me. I am completely blank with it...
- math - Which two is true as i'm confused A) 3+7 10 mod 15 17 + 9 4 mod 21 ...
- number theory - give an example to show that a^2 congruent to b^2 mod n need not...
- Proofs and numbers - Prove the following theorem: Suppose p is a prime number, r...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- math - Which Statements of congruence are true and which are false and why? 177 ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...
- A number thoery question - Please help me! Thank you very much. Prove Fermat's ...
- DISCRETE MATHS - Prove that if n is an odd positive integer, then 1 ≡ n2 (...
- Discrete Mathematics - Prove that if n is an odd positive integer, then 1 ≡...