A Counterexample to the statement, If a\equiv b\pmod m and c\equiv d\pmod m, where a,b,c,d, and m are integers with c and d positive and m \geq 2, then a^{c}\equiv b^{d}\pmod m.

glamrockqueen7

glamrockqueen7

Answered question

2021-02-27

A Counterexample to the statement, If ab±odm and cd±odm, where a,b,c,d, and m are integers with c and d positive and m2, then acbd±odm.

Answer & Explanation

Ayesha Gomez

Ayesha Gomez

Skilled2021-03-01Added 104 answers

Here we need to just find one counter example that contradicts the validity of the given statement.
Suppose we set values a = 2, b=2, c= 4, d=9, and m=5 in
ab±odm
We get,
22±od5, thus this congruence is satisfied.
Next let us plug these values in cd±odm
We get,
49±od5, observe that 9=4+1×5, thus
44±od5, again this congruence is also satisfied.
Lastly we plug these values into acbd±odm
We get,
2429±od5
16512±od5, observe that
16=1+3×5 and 512=2+102×5, thus
1±od52±od5, which is incorrect
Thus a counterexample could be the set of values
a=2, b=2, c=4, d=9, and m =5

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?