How can I check if “value is fractional multiple of another” in “modulo sense”?
$begingroup$
How can I check if "value is fractional multiple of another" in "modulo sense"?
Typically in programming the modulo is used like:
if n mod m == 0
which means that $n$ is an integer multiple of $m$.
However, what if I want to check whether $n$ is a $1/10th$ of $m$ in the "recurring" modulo sense? That is, e.g.
$m=20$, consider
$n=2$, should return true since $2/20=1/10$
$n=22$, should return true.
$n=42$, should return true.
...
(the pattern you see in $n$ is "recurring", because even when $n$ is a different number it's evaluated in the same way as the base case.
Could it be as simple as taking $n mod m = r$, then checking if $r / m = text{desired fractional}$?
modular-arithmetic
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
$endgroup$
add a comment |
$begingroup$
How can I check if "value is fractional multiple of another" in "modulo sense"?
Typically in programming the modulo is used like:
if n mod m == 0
which means that $n$ is an integer multiple of $m$.
However, what if I want to check whether $n$ is a $1/10th$ of $m$ in the "recurring" modulo sense? That is, e.g.
$m=20$, consider
$n=2$, should return true since $2/20=1/10$
$n=22$, should return true.
$n=42$, should return true.
...
(the pattern you see in $n$ is "recurring", because even when $n$ is a different number it's evaluated in the same way as the base case.
Could it be as simple as taking $n mod m = r$, then checking if $r / m = text{desired fractional}$?
modular-arithmetic
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
$endgroup$
2
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
2
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31
add a comment |
$begingroup$
How can I check if "value is fractional multiple of another" in "modulo sense"?
Typically in programming the modulo is used like:
if n mod m == 0
which means that $n$ is an integer multiple of $m$.
However, what if I want to check whether $n$ is a $1/10th$ of $m$ in the "recurring" modulo sense? That is, e.g.
$m=20$, consider
$n=2$, should return true since $2/20=1/10$
$n=22$, should return true.
$n=42$, should return true.
...
(the pattern you see in $n$ is "recurring", because even when $n$ is a different number it's evaluated in the same way as the base case.
Could it be as simple as taking $n mod m = r$, then checking if $r / m = text{desired fractional}$?
modular-arithmetic
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
$endgroup$
How can I check if "value is fractional multiple of another" in "modulo sense"?
Typically in programming the modulo is used like:
if n mod m == 0
which means that $n$ is an integer multiple of $m$.
However, what if I want to check whether $n$ is a $1/10th$ of $m$ in the "recurring" modulo sense? That is, e.g.
$m=20$, consider
$n=2$, should return true since $2/20=1/10$
$n=22$, should return true.
$n=42$, should return true.
...
(the pattern you see in $n$ is "recurring", because even when $n$ is a different number it's evaluated in the same way as the base case.
Could it be as simple as taking $n mod m = r$, then checking if $r / m = text{desired fractional}$?
modular-arithmetic
modular-arithmetic
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
edited Dec 16 '18 at 15:22
mavavilj
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
asked Dec 16 '18 at 15:14
mavaviljmavavilj
2,81911137
2,81911137
2
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
2
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31
add a comment |
2
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
2
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31
2
2
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
2
2
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31
add a comment |
0
active
oldest
votes
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%2f3042710%2fhow-can-i-check-if-value-is-fractional-multiple-of-another-in-modulo-sense%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3042710%2fhow-can-i-check-if-value-is-fractional-multiple-of-another-in-modulo-sense%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
2
$begingroup$
Please define the used "terms".
$endgroup$
– gammatester
Dec 16 '18 at 15:19
$begingroup$
In your example, do you mean $n equiv 1 pmod {10}$?
$endgroup$
– Maged Saeed
Dec 16 '18 at 15:20
$begingroup$
@MagedSaeed I'm trying to figure out what the relation for $n$ is, basing on that I know $n mod m$.
$endgroup$
– mavavilj
Dec 16 '18 at 15:21
2
$begingroup$
This is hard to follow. It looks like you are just asking if $nequiv 2 pmod {20}$ but I am not at all sure this is correct.
$endgroup$
– lulu
Dec 16 '18 at 15:31