solving-set-of-gcd-equations (continued discussion)
With reference to this question, I am trying to generalize my previous question here.
If I have two GCD equations with common variable $m$ as follow: $GCD(m,p_i)=1$ and $GCD(m+7,p_i)=1$ where $p_i$ takes values from the first 20 prime numbers. can the two GCD equations be combined (since they both share second argument $p_i$)?
My target is to get all potential values of $m$ (in a given range, say from 1 to 1000). I thought if we can combine the two GCD equations into one GCD equation (for each $p_i$) then we have probably good base to calculate all values of m.
prime-numbers systems-of-equations greatest-common-divisor
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
add a comment |
With reference to this question, I am trying to generalize my previous question here.
If I have two GCD equations with common variable $m$ as follow: $GCD(m,p_i)=1$ and $GCD(m+7,p_i)=1$ where $p_i$ takes values from the first 20 prime numbers. can the two GCD equations be combined (since they both share second argument $p_i$)?
My target is to get all potential values of $m$ (in a given range, say from 1 to 1000). I thought if we can combine the two GCD equations into one GCD equation (for each $p_i$) then we have probably good base to calculate all values of m.
prime-numbers systems-of-equations greatest-common-divisor
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50
add a comment |
With reference to this question, I am trying to generalize my previous question here.
If I have two GCD equations with common variable $m$ as follow: $GCD(m,p_i)=1$ and $GCD(m+7,p_i)=1$ where $p_i$ takes values from the first 20 prime numbers. can the two GCD equations be combined (since they both share second argument $p_i$)?
My target is to get all potential values of $m$ (in a given range, say from 1 to 1000). I thought if we can combine the two GCD equations into one GCD equation (for each $p_i$) then we have probably good base to calculate all values of m.
prime-numbers systems-of-equations greatest-common-divisor
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
With reference to this question, I am trying to generalize my previous question here.
If I have two GCD equations with common variable $m$ as follow: $GCD(m,p_i)=1$ and $GCD(m+7,p_i)=1$ where $p_i$ takes values from the first 20 prime numbers. can the two GCD equations be combined (since they both share second argument $p_i$)?
My target is to get all potential values of $m$ (in a given range, say from 1 to 1000). I thought if we can combine the two GCD equations into one GCD equation (for each $p_i$) then we have probably good base to calculate all values of m.
prime-numbers systems-of-equations greatest-common-divisor
prime-numbers systems-of-equations greatest-common-divisor
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
edited Nov 21 '18 at 13:35
Klangen
1,65411334
edited Nov 21 '18 at 13:35
Klangen
1,65411334
edited Nov 21 '18 at 13:35
Klangen
1,65411334
1,65411334
asked Aug 17 '17 at 18:09
bijan karimi
144
asked Aug 17 '17 at 18:09
bijan karimi
144
asked Aug 17 '17 at 18:09
bijan karimi
144
144
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50
add a comment |
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50
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%2f2397188%2fsolving-set-of-gcd-equations-continued-discussion%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.
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%2f2397188%2fsolving-set-of-gcd-equations-continued-discussion%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
$gcd(m,p_i)=1$ and $gcd(m+7,p_i)=1$ combine to give $gcd(m(m+7),p_i)=1$.
– Gerry Myerson
Aug 18 '17 at 0:22
@GerryMyerson, OH yes, this is allowed! thanks a lot.!
– bijan karimi
Aug 18 '17 at 0:50