A Counterexample to the statement, If ac\equiv bc\pmod m, where a,b,c, and m are integers with m \geq 2, then a\equiv b \pmod m.

Rivka Thorpe

Rivka Thorpe

Answered question

2021-04-30

A Counterexample to the statement, If acbc(modm), where a,b,c, and m are integers with m2, then ab(modm).

Answer & Explanation

pivonie8

pivonie8

Skilled2021-05-02Added 91 answers

Here we need to just find one counter example that contradicts the validity of the given statement.
Suppose we set values a=0, b=1, c=3, m=4 in acbc(modm)
We get,
0×11×3(mod3)
0=3(mod3)
0=0
Thus, this congruence is satisfied.
Next let us plug these values in ab(modm)
We get,
01(mod3), which is obviously incorrect.
Thus a counterexample could be the set of value
a=0, b=1, c=3, m=4

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

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?