Proof that if a \equiv b (\bmod n), then a+c \equiv b+c(\bmod n) and ac \equiv bc (\bmod n).

Nannie Mack

Nannie Mack

Answered question

2021-02-26

Proof that if ab(bmodn), then a+cb+c(bmodn) and acbc(bmodn).

Answer & Explanation

Willie

Willie

Skilled2021-02-28Added 95 answers

Step 1
Apply the definition of congruence and divisibility, to express ab(bmodn).
From the definition of congruence, ab(bmodn) means that n(ab).
By the definition of divisibility, n(ab) implies that (ab) is a multiple of n.
That is, ab=nk, where k is an integer.
Step 2
To prove a+cb+c(bmodn), add and subtract c on the left hand side of the equation
ab=nk and use the definition of congruence.
ab=nk
ab+cc=nk
(a+c)(b+c)=nk
Since, (a+c)(b+c) is a multiple of n, implies that n[(a+c)(b+c)].
Hence, by the definition of congruence, a+c=≡b+c(bmodn).
Thus, if ab(bmodn) then a+c=≡b+c(bmodn).
Step 3
To prove acbc(bmodn), use the definition of congruence and the properties of divisibility.
ab(bmodn) implies that n(ab).
By the properties of divisibility, if n divides (ab) then n also divides the multiple of (ab).
That is, n|(ab)c=n|(acbc)
Hence, by the definition of congruence, acbc(bmodn).
Therefore, if ab(bmodn) then acbc(bmodn).

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?