Wednesday, 25 December 2019

elementary number theory - Congruence relationships.

I need to prove (or disprove but I don't think that's the case) that:




if ab0 (mod n), then a0 (mod n) or b0 (mod n)





I know that ab0 (mod n) n|ab, so if that's true then n must divide either a or b but I don't know how to prove it.



Any assistance is much appreciated.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...