# Congruence Proof

• Sep 29th 2008, 12:00 PM
porterhv
Congruence Proof
Prove that If a ≡ b (mod n) and c > 0, then ca ≡ cb (mod cn).
• Sep 29th 2008, 12:02 PM
Moo
Quote:

Originally Posted by porterhv
Prove that If a ≡ b (mod n) and c > 0, then ca ≡ cb (mod cn).

$a \equiv b (\bmod n) \Leftrightarrow \exists k \in \mathbb{Z} \text{ such that } a-b=kn$

$\implies ca-cb=ckn$

$\implies ca-cb=k(cn)$

$\implies ca \equiv cb (\bmod{cn})$

Edit : hey ! that's my 34:):)th ^^