Asked by migbaru
Give an example to show that a
2 ≡ b
2
(mod n) need not imply that a ≡
b(mod n)
2 ≡ b
2
(mod n) need not imply that a ≡
b(mod n)
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)
that means
b/2 = kn + a/2
b = 2kn + a
so b-a = 2kn ≡ 0 (mod n)
Thus a≡b (mod n)
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.