Ask a New Question

Asked by migbaru

Give an example to show that a
2 ≡ b
2
(mod n) need not imply that a ≡
b(mod n)
3 years ago

Answers

Answered by oobleck
assuming you meant a/2 ≡ b/2 (mod n)
that means
b/2 = kn + a/2
b = 2kn + a
so b-a = 2kn ≡ 0 (mod n)
Thus a≡b (mod n)
3 years ago
There are no AI answers yet. The ability to request AI answers is coming soon!

Submit Your Answer


We prioritize human answers over AI answers.

If you are human, and you can answer this question, please submit your answer.

Related Questions

give an example to show that a^2 congruent to b^2 mod n need not imply that a congruent to b mod n. give one example to show that wants arise and grow . Give an example to show that the product of two one-to-one function is not necessarily a one-to-one... Give an example to show that contemporary racism is viewed as being a remnant of past historical rac... GIVE AN EXPIRIMENT TO SHOW THAT AIR HAS WEIGHT. Give a counterexample to show that the following generalization about the set of integers is false.... Give a counterexample to show that each of the following generalizations about the set of integers {... Give two examples to show how physics help in understanding the concept of evolution, biological sy... Please show steps and give me explanations! Thank you. 1. If x=1/2, what is the value of 1/x+... give a counter example to show that each statement is false, the domain of each variable is the set...
Submit Your Answer

Question

Give an example to show that a
2 ≡ b
2
(mod n) need not imply that a ≡
b(mod n)

Ask a New Question
Archives Contact Us Privacy Policy Terms of Use