modular arithmetic addition rule
Consider this addition rule in modular arithmetic:
If I take n=10, a=3, b=7
Then, on the left hand side, we have (3)mod10 + (7)mod10= 3 + 7 = 10
On the right hand side, we have 10 mod10, which is zero.
LHS is therefore not equal to RHS.
What am I doing wrong?
modular-arithmetic
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
add a comment |
Consider this addition rule in modular arithmetic:
If I take n=10, a=3, b=7
Then, on the left hand side, we have (3)mod10 + (7)mod10= 3 + 7 = 10
On the right hand side, we have 10 mod10, which is zero.
LHS is therefore not equal to RHS.
What am I doing wrong?
modular-arithmetic
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15
add a comment |
Consider this addition rule in modular arithmetic:
If I take n=10, a=3, b=7
Then, on the left hand side, we have (3)mod10 + (7)mod10= 3 + 7 = 10
On the right hand side, we have 10 mod10, which is zero.
LHS is therefore not equal to RHS.
What am I doing wrong?
modular-arithmetic
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
Consider this addition rule in modular arithmetic:
If I take n=10, a=3, b=7
Then, on the left hand side, we have (3)mod10 + (7)mod10= 3 + 7 = 10
On the right hand side, we have 10 mod10, which is zero.
LHS is therefore not equal to RHS.
What am I doing wrong?
modular-arithmetic
modular-arithmetic
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
asked Nov 29 '18 at 2:46
childishsadbinochildishsadbino
1148
1148
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15
add a comment |
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15
add a comment |
2 Answers
2
active
oldest
votes
$mod 10$ is not the remainder function. $3 mod 10$ does not equal the number $3$ and $3$ exactly.
$3 pmod {10}$ means $3$ is a representative of any of the infinite numbers that are equivalent to $3$. (That is any one of $.....-17, -7,3,13, 23.....$etc.) And we aren't saying anything about specific numbers. We are saying things what classes of infinite numbers all have in common and who they relate.
If you have a number that is in the class $3$ represents. (Let's say the number $-2,317$) And you have a number in the class that $7$ represents. (Let's say $5,892,407$) and you add them together then the sum is going to be in the same class that $3+7$ is in.
And indeed $-2,317 + 5,892,407= 5,890,090$ and both $5,890,090$ and $10$ are both in the class ${....., -30, -20, -10, 0, 10, 20, 30,....}$. That is the class represent by $0$. (ALthough it could just as easily have bee represented by $10$, or by $20$, or $-130$. or....)
That is what the statement $3pmod {10} + 7 pmod {10} equiv (3+7) pmod {10}$ means.
Also notice that that is not an equal sign with two stripes; it is an equivalence sign with three stripes.
When we do modular arithmetic we can think of what we are doing it two equivalent ways:
1) (a bit abstract). We are doing math on entire classes of integers and $3$ is the set ${...-17,-7, 3,13...}$ and $7$ is the set ${....-13,-3, 7,17,....}$ and $3 + 7$ is an operation which is "set addition" where ${...-17,-7, 3,13...}+{....-13,-3, 7,17,....}= {....., -20,-10,0,10,20...}$ which is represented by $0$.
2) $equiv$ is not $=$. The statement $3 + 7 equiv 0 pmod {10}$ is not saying anything about what $3+7$ or what $0$ is. It is saying $3+7=10$ and $0$ both belong in the same equivalence class.
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
add a comment |
You have to apply $text{mod}(10)$ on both sides of any equation involving modular arithmetic.
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018085%2fmodular-arithmetic-addition-rule%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$mod 10$ is not the remainder function. $3 mod 10$ does not equal the number $3$ and $3$ exactly.
$3 pmod {10}$ means $3$ is a representative of any of the infinite numbers that are equivalent to $3$. (That is any one of $.....-17, -7,3,13, 23.....$etc.) And we aren't saying anything about specific numbers. We are saying things what classes of infinite numbers all have in common and who they relate.
If you have a number that is in the class $3$ represents. (Let's say the number $-2,317$) And you have a number in the class that $7$ represents. (Let's say $5,892,407$) and you add them together then the sum is going to be in the same class that $3+7$ is in.
And indeed $-2,317 + 5,892,407= 5,890,090$ and both $5,890,090$ and $10$ are both in the class ${....., -30, -20, -10, 0, 10, 20, 30,....}$. That is the class represent by $0$. (ALthough it could just as easily have bee represented by $10$, or by $20$, or $-130$. or....)
That is what the statement $3pmod {10} + 7 pmod {10} equiv (3+7) pmod {10}$ means.
Also notice that that is not an equal sign with two stripes; it is an equivalence sign with three stripes.
When we do modular arithmetic we can think of what we are doing it two equivalent ways:
1) (a bit abstract). We are doing math on entire classes of integers and $3$ is the set ${...-17,-7, 3,13...}$ and $7$ is the set ${....-13,-3, 7,17,....}$ and $3 + 7$ is an operation which is "set addition" where ${...-17,-7, 3,13...}+{....-13,-3, 7,17,....}= {....., -20,-10,0,10,20...}$ which is represented by $0$.
2) $equiv$ is not $=$. The statement $3 + 7 equiv 0 pmod {10}$ is not saying anything about what $3+7$ or what $0$ is. It is saying $3+7=10$ and $0$ both belong in the same equivalence class.
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
add a comment |
$mod 10$ is not the remainder function. $3 mod 10$ does not equal the number $3$ and $3$ exactly.
$3 pmod {10}$ means $3$ is a representative of any of the infinite numbers that are equivalent to $3$. (That is any one of $.....-17, -7,3,13, 23.....$etc.) And we aren't saying anything about specific numbers. We are saying things what classes of infinite numbers all have in common and who they relate.
If you have a number that is in the class $3$ represents. (Let's say the number $-2,317$) And you have a number in the class that $7$ represents. (Let's say $5,892,407$) and you add them together then the sum is going to be in the same class that $3+7$ is in.
And indeed $-2,317 + 5,892,407= 5,890,090$ and both $5,890,090$ and $10$ are both in the class ${....., -30, -20, -10, 0, 10, 20, 30,....}$. That is the class represent by $0$. (ALthough it could just as easily have bee represented by $10$, or by $20$, or $-130$. or....)
That is what the statement $3pmod {10} + 7 pmod {10} equiv (3+7) pmod {10}$ means.
Also notice that that is not an equal sign with two stripes; it is an equivalence sign with three stripes.
When we do modular arithmetic we can think of what we are doing it two equivalent ways:
1) (a bit abstract). We are doing math on entire classes of integers and $3$ is the set ${...-17,-7, 3,13...}$ and $7$ is the set ${....-13,-3, 7,17,....}$ and $3 + 7$ is an operation which is "set addition" where ${...-17,-7, 3,13...}+{....-13,-3, 7,17,....}= {....., -20,-10,0,10,20...}$ which is represented by $0$.
2) $equiv$ is not $=$. The statement $3 + 7 equiv 0 pmod {10}$ is not saying anything about what $3+7$ or what $0$ is. It is saying $3+7=10$ and $0$ both belong in the same equivalence class.
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
add a comment |
$mod 10$ is not the remainder function. $3 mod 10$ does not equal the number $3$ and $3$ exactly.
$3 pmod {10}$ means $3$ is a representative of any of the infinite numbers that are equivalent to $3$. (That is any one of $.....-17, -7,3,13, 23.....$etc.) And we aren't saying anything about specific numbers. We are saying things what classes of infinite numbers all have in common and who they relate.
If you have a number that is in the class $3$ represents. (Let's say the number $-2,317$) And you have a number in the class that $7$ represents. (Let's say $5,892,407$) and you add them together then the sum is going to be in the same class that $3+7$ is in.
And indeed $-2,317 + 5,892,407= 5,890,090$ and both $5,890,090$ and $10$ are both in the class ${....., -30, -20, -10, 0, 10, 20, 30,....}$. That is the class represent by $0$. (ALthough it could just as easily have bee represented by $10$, or by $20$, or $-130$. or....)
That is what the statement $3pmod {10} + 7 pmod {10} equiv (3+7) pmod {10}$ means.
Also notice that that is not an equal sign with two stripes; it is an equivalence sign with three stripes.
When we do modular arithmetic we can think of what we are doing it two equivalent ways:
1) (a bit abstract). We are doing math on entire classes of integers and $3$ is the set ${...-17,-7, 3,13...}$ and $7$ is the set ${....-13,-3, 7,17,....}$ and $3 + 7$ is an operation which is "set addition" where ${...-17,-7, 3,13...}+{....-13,-3, 7,17,....}= {....., -20,-10,0,10,20...}$ which is represented by $0$.
2) $equiv$ is not $=$. The statement $3 + 7 equiv 0 pmod {10}$ is not saying anything about what $3+7$ or what $0$ is. It is saying $3+7=10$ and $0$ both belong in the same equivalence class.
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
$mod 10$ is not the remainder function. $3 mod 10$ does not equal the number $3$ and $3$ exactly.
$3 pmod {10}$ means $3$ is a representative of any of the infinite numbers that are equivalent to $3$. (That is any one of $.....-17, -7,3,13, 23.....$etc.) And we aren't saying anything about specific numbers. We are saying things what classes of infinite numbers all have in common and who they relate.
If you have a number that is in the class $3$ represents. (Let's say the number $-2,317$) And you have a number in the class that $7$ represents. (Let's say $5,892,407$) and you add them together then the sum is going to be in the same class that $3+7$ is in.
And indeed $-2,317 + 5,892,407= 5,890,090$ and both $5,890,090$ and $10$ are both in the class ${....., -30, -20, -10, 0, 10, 20, 30,....}$. That is the class represent by $0$. (ALthough it could just as easily have bee represented by $10$, or by $20$, or $-130$. or....)
That is what the statement $3pmod {10} + 7 pmod {10} equiv (3+7) pmod {10}$ means.
Also notice that that is not an equal sign with two stripes; it is an equivalence sign with three stripes.
When we do modular arithmetic we can think of what we are doing it two equivalent ways:
1) (a bit abstract). We are doing math on entire classes of integers and $3$ is the set ${...-17,-7, 3,13...}$ and $7$ is the set ${....-13,-3, 7,17,....}$ and $3 + 7$ is an operation which is "set addition" where ${...-17,-7, 3,13...}+{....-13,-3, 7,17,....}= {....., -20,-10,0,10,20...}$ which is represented by $0$.
2) $equiv$ is not $=$. The statement $3 + 7 equiv 0 pmod {10}$ is not saying anything about what $3+7$ or what $0$ is. It is saying $3+7=10$ and $0$ both belong in the same equivalence class.
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
edited Nov 29 '18 at 3:41
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
answered Nov 29 '18 at 3:27
fleabloodfleablood
68.6k22685
68.6k22685
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
add a comment |
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
Both $ 3mod 10 $ and $ 3pmod{!10} $ are major abuses of notation, and such abuse often confuses many beginners. One should avoid using it when attempting to clarify such matters.
– Bill Dubuque
Nov 29 '18 at 3:42
1
1
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
@OP see here and here for the difference between the binary operation $,abmod n,$ vs. ternary relation $,a equiv bpmod{n},$ of congruence (an equivalence relation for fixed $n) $
– Bill Dubuque
Nov 29 '18 at 4:08
add a comment |
You have to apply $text{mod}(10)$ on both sides of any equation involving modular arithmetic.
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
add a comment |
You have to apply $text{mod}(10)$ on both sides of any equation involving modular arithmetic.
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
add a comment |
You have to apply $text{mod}(10)$ on both sides of any equation involving modular arithmetic.
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
You have to apply $text{mod}(10)$ on both sides of any equation involving modular arithmetic.
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
answered Nov 29 '18 at 2:49
ChickenmancerChickenmancer
3,454724
3,454724
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
add a comment |
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
but doesn't applying mod(10) for LHS give us 3 mod(10) + 7 mod(10) , which is just 3 + 7?
– childishsadbino
Nov 29 '18 at 2:54
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
No. $3+7$ is a representative of $3+7 mod (10).$ You could have also written $0 mod (10)$ or $20mod(10).$
– Chickenmancer
Nov 29 '18 at 14:43
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3018085%2fmodular-arithmetic-addition-rule%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
It's an equality of equivalence (congruence) classes but you are working with representatives of the classes. The reps will be equal only if your normalize them to a canonical rep from each class (e.g. least nonnegative).
– Bill Dubuque
Nov 29 '18 at 3:02
$0 mod 10$ is not equivalent to $10 mod 10$??? You have $10 mod 10$ on both sides. You've done everything right and you reached the conclusion you wanted.
– fleablood
Nov 29 '18 at 3:15