Let n be a fixed positive integer greater thatn 1 and let a and b be positive integers. Prove that a mod n = b mon n if and only if a = b mod.

smileycellist2

smileycellist2

Answered question

2020-11-24

Let n be a fixed positive integer greater thatn 1 and let a and b be positive integers. Prove that a mod n = b mon n if and only if a = b mod.

Answer & Explanation

Arham Warner

Arham Warner

Skilled2020-11-25Added 102 answers

Since a mod n is a remaider when dividing a by n, we have that a mod n=a-kn
Similarly, b mod n=b-ln
Now notice that a mod n=b mod n if and only if a-kn=b-ln
which holds if and only if a-b=(k-l)n
Recall that, by definition, a=b mod n if and only if a-b=mn, where m is some integer.
Since k and l are integers, k-l is also an integer. Thus, a-b=(k-l)n
if and only if a=b mod n
Thus, we have proven that a mod n=b mod n if and only if a=b mod n, as required.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Linear algebra

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?