Applying set operations on congruent mod relation
$begingroup$
I've been asked a question to solve about congruent modulo. But the question is very different than another congruent modulo questions I have seen so far. It wants me to apply set operations on it. Can you give me a hint how to solve this question, not the answer. Thanks in advance...
Question:
https://ibb.co/SKQYCys
discrete-mathematics modular-arithmetic congruence-relations
$endgroup$
add a comment |
$begingroup$
I've been asked a question to solve about congruent modulo. But the question is very different than another congruent modulo questions I have seen so far. It wants me to apply set operations on it. Can you give me a hint how to solve this question, not the answer. Thanks in advance...
Question:
https://ibb.co/SKQYCys
discrete-mathematics modular-arithmetic congruence-relations
$endgroup$
add a comment |
$begingroup$
I've been asked a question to solve about congruent modulo. But the question is very different than another congruent modulo questions I have seen so far. It wants me to apply set operations on it. Can you give me a hint how to solve this question, not the answer. Thanks in advance...
Question:
https://ibb.co/SKQYCys
discrete-mathematics modular-arithmetic congruence-relations
$endgroup$
I've been asked a question to solve about congruent modulo. But the question is very different than another congruent modulo questions I have seen so far. It wants me to apply set operations on it. Can you give me a hint how to solve this question, not the answer. Thanks in advance...
Question:
https://ibb.co/SKQYCys
discrete-mathematics modular-arithmetic congruence-relations
discrete-mathematics modular-arithmetic congruence-relations
asked Dec 11 '18 at 10:18
Ozan YurtseverOzan Yurtsever
1031
1031
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Well, there's not much you can say to describe the union and the set-theoretic difference, other than to refer to them as such. I must confess I don't understand what the symbol denotes in d. (perhaps a 'direct product' of relations on the direct product' of supporting sets).
The interesting things start happening at b. It is a fact that an arbitrary (non-empty) intersection of equivalences remains an equivalence. Further more, the exercise you mention deals not merely with abstract equivalences, but with special ones that exhibit additional compatibility with the algebraic operations usually defined on the integers (such equivalences are generally called congruences).
It is worth stating the following result. For arbitrary $n in mathbb{N}$ let us denote the congruence modulo $n$ by $R_n$; it then holds that:
$R_m cap R_n=R_{[m,n]}$
where $[m,n]$ denotes the least common multiple of $m$ and $n$.
$endgroup$
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%2f3035140%2fapplying-set-operations-on-congruent-mod-relation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Well, there's not much you can say to describe the union and the set-theoretic difference, other than to refer to them as such. I must confess I don't understand what the symbol denotes in d. (perhaps a 'direct product' of relations on the direct product' of supporting sets).
The interesting things start happening at b. It is a fact that an arbitrary (non-empty) intersection of equivalences remains an equivalence. Further more, the exercise you mention deals not merely with abstract equivalences, but with special ones that exhibit additional compatibility with the algebraic operations usually defined on the integers (such equivalences are generally called congruences).
It is worth stating the following result. For arbitrary $n in mathbb{N}$ let us denote the congruence modulo $n$ by $R_n$; it then holds that:
$R_m cap R_n=R_{[m,n]}$
where $[m,n]$ denotes the least common multiple of $m$ and $n$.
$endgroup$
add a comment |
$begingroup$
Well, there's not much you can say to describe the union and the set-theoretic difference, other than to refer to them as such. I must confess I don't understand what the symbol denotes in d. (perhaps a 'direct product' of relations on the direct product' of supporting sets).
The interesting things start happening at b. It is a fact that an arbitrary (non-empty) intersection of equivalences remains an equivalence. Further more, the exercise you mention deals not merely with abstract equivalences, but with special ones that exhibit additional compatibility with the algebraic operations usually defined on the integers (such equivalences are generally called congruences).
It is worth stating the following result. For arbitrary $n in mathbb{N}$ let us denote the congruence modulo $n$ by $R_n$; it then holds that:
$R_m cap R_n=R_{[m,n]}$
where $[m,n]$ denotes the least common multiple of $m$ and $n$.
$endgroup$
add a comment |
$begingroup$
Well, there's not much you can say to describe the union and the set-theoretic difference, other than to refer to them as such. I must confess I don't understand what the symbol denotes in d. (perhaps a 'direct product' of relations on the direct product' of supporting sets).
The interesting things start happening at b. It is a fact that an arbitrary (non-empty) intersection of equivalences remains an equivalence. Further more, the exercise you mention deals not merely with abstract equivalences, but with special ones that exhibit additional compatibility with the algebraic operations usually defined on the integers (such equivalences are generally called congruences).
It is worth stating the following result. For arbitrary $n in mathbb{N}$ let us denote the congruence modulo $n$ by $R_n$; it then holds that:
$R_m cap R_n=R_{[m,n]}$
where $[m,n]$ denotes the least common multiple of $m$ and $n$.
$endgroup$
Well, there's not much you can say to describe the union and the set-theoretic difference, other than to refer to them as such. I must confess I don't understand what the symbol denotes in d. (perhaps a 'direct product' of relations on the direct product' of supporting sets).
The interesting things start happening at b. It is a fact that an arbitrary (non-empty) intersection of equivalences remains an equivalence. Further more, the exercise you mention deals not merely with abstract equivalences, but with special ones that exhibit additional compatibility with the algebraic operations usually defined on the integers (such equivalences are generally called congruences).
It is worth stating the following result. For arbitrary $n in mathbb{N}$ let us denote the congruence modulo $n$ by $R_n$; it then holds that:
$R_m cap R_n=R_{[m,n]}$
where $[m,n]$ denotes the least common multiple of $m$ and $n$.
answered Dec 11 '18 at 11:58
ΑΘΩΑΘΩ
2463
2463
add a comment |
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.
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%2f3035140%2fapplying-set-operations-on-congruent-mod-relation%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