solving-set-of-gcd-equations (continued discussion)
up vote
0
down vote
favorite
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 2 days ago
Flermat
1,27911129
asked Aug 17 '17 at 18:09
bijan karimi
144
add a comment |
up vote
0
down vote
favorite
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 2 days ago
Flermat
1,27911129
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 |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
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 2 days ago
Flermat
1,27911129
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 2 days ago
Flermat
1,27911129
asked Aug 17 '17 at 18:09
bijan karimi
144
edited 2 days ago
Flermat
1,27911129
asked Aug 17 '17 at 18:09
bijan karimi
144
edited 2 days ago
Flermat
1,27911129
edited 2 days ago
Flermat
1,27911129
edited 2 days ago
Flermat
1,27911129
1,27911129
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 |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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