mathbalarka wrote:By your problem, a isnt divisible by b.
now by you assumption, a = b + nc where c is any integer. Then squaring both sides, it becomes a^2 = b^2 + n(2bc + nc^2) so, a^2 = b^2 (mod n) Q. E. D
The Chaz wrote:a == b
mathbalarka wrote:The Chaz wrote:a == b
The Chaz wrote:CRGreathouse wrote:...
== is commonly used to mean when you don't have access to special characters.
... or when you're too lazy for LaTex
I don't think a *strong* understanding of modular arithmetic is necessary... You just have to know that numbers are congruent means that their difference is (congruent to) zero. Using that 1 piece of information on the hypothesis and conclusion leads to
a - b == 0 Some step(s) in between... a^2 - b^2 == 0
So there's only one step to take a - b to the difference of squares. Is it really that hard to see? Maybe I'm just above average mathematical genius (American version).
(by the way, that "genius" comment is a joke about someone we used to know and love)
Users browsing this forum: mathbalarka and 7 guests