Last active
January 2, 2016 20:29
-
-
Save ordovician/8357126 to your computer and use it in GitHub Desktop.
Equivalence Relations in modulo aritmetic.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mod(A, C) == r | |
| # then | |
| mod(A + k*C, C) == r | |
| # so if | |
| mod(A, C) == mod(B, C) | |
| # then | |
| mod(A, C) == mod(A + k*C, C) == mod(B, C) | |
| # so | |
| B == A + k*C | |
| # meaning | |
| A - B == A - (A + k*C) | |
| A - B == k*C | |
| # which shows that C is a factor of A - B, which we write as: | |
| # C | (A-B) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment