Wednesday

April 23, 2014

April 23, 2014

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

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

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

**Related Questions**

Proofs and numbers - Prove the following theorem: Suppose p is a prime number, r...

DISCRETE MATHS - Prove that if n is an odd positive integer, then 1 ≡ n2 (...

discrete math - 1)prove that if x is rational and x not equal to 0, then 1/x is ...

Discrete Mathematics - Prove that if n is an odd positive integer, then 1 ≡...

Discrete Math - Theorem: For every integer n, if x and y are positive integers ...

another college math question - Please teach me. I am completely blank with it...

Discrete Math - 1. Assume that n is a positive integer. Use the proof by ...

discrete math - Let A= {for all m that's an element of the integers | m=3k+7 for...

A number thoery question - Please help me! Thank you very much. Prove Fermat's ...

discrete math - 5= (1+4) (1+4)^n= 1^n + 2*1*4 + ...+4^n which is 1 mod 4 Prove ...