How should I solve this equation using modular arithmetic? [closed]
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Find the smallest values of x,y that satisfy:
77x=13y+2
Please show how I can solve this using modular arithmetic, in simple steps(I am a novice to modular arithmetic).
Also, is there a way to solve this equation(except for simple trial and error) without using modular arithmetic?
elementary-number-theory modular-arithmetic
closed as off-topic by José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister Aug 22 at 13:00
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister
 |Â
show 2 more comments
up vote
1
down vote
favorite
Find the smallest values of x,y that satisfy:
77x=13y+2
Please show how I can solve this using modular arithmetic, in simple steps(I am a novice to modular arithmetic).
Also, is there a way to solve this equation(except for simple trial and error) without using modular arithmetic?
elementary-number-theory modular-arithmetic
closed as off-topic by José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister Aug 22 at 13:00
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister
4
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
1
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Yes, only non-negative
â user16701
Aug 22 at 7:48
1
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57
 |Â
show 2 more comments
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Find the smallest values of x,y that satisfy:
77x=13y+2
Please show how I can solve this using modular arithmetic, in simple steps(I am a novice to modular arithmetic).
Also, is there a way to solve this equation(except for simple trial and error) without using modular arithmetic?
elementary-number-theory modular-arithmetic
Find the smallest values of x,y that satisfy:
77x=13y+2
Please show how I can solve this using modular arithmetic, in simple steps(I am a novice to modular arithmetic).
Also, is there a way to solve this equation(except for simple trial and error) without using modular arithmetic?
elementary-number-theory modular-arithmetic
edited Aug 22 at 8:46
N. F. Taussig
38.8k93153
38.8k93153
asked Aug 22 at 7:41
user16701
856
856
closed as off-topic by José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister Aug 22 at 13:00
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister
closed as off-topic by José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister Aug 22 at 13:00
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â José Carlos Santos, Dietrich Burde, awllower, amWhy, Adrian Keister
4
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
1
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Yes, only non-negative
â user16701
Aug 22 at 7:48
1
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57
 |Â
show 2 more comments
4
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
1
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Yes, only non-negative
â user16701
Aug 22 at 7:48
1
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57
4
4
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
1
1
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Yes, only non-negative
â user16701
Aug 22 at 7:48
Yes, only non-negative
â user16701
Aug 22 at 7:48
1
1
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57
 |Â
show 2 more comments
4 Answers
4
active
oldest
votes
up vote
1
down vote
Hint: You can write $$77xequiv 2mod 13$$ and you can solve it like $$xequiv frac277 mod 13$$ and you and add the modul to the numerator $$frac2+13+13+...+1377$$ until we get a whole number.
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
add a comment |Â
up vote
0
down vote
You are looking for an integer $x$ such that $77xequiv2pmod13$.
Also $77equiv-1pmod13$, I think you know how to go on from here.
Hope this helps.
add a comment |Â
up vote
0
down vote
I think for finding an answer we need trial and error but we know that one answer exists when $0le x<13$. One answer is $$x=11\y=65$$and the general answer would become $$x=11+13k\y=65+77k\kinBbb Z$$
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
add a comment |Â
up vote
0
down vote
For any pair of integers $ x,y$ satisfying the equation we can obtain the congruency $77x equiv 2 mod13$.
As you commented that you don't know how to solve such equations, i'm gonna try and explain them without assuming you know the basic theory behind it.
There is a standard way using divison algorithm successively to obtain at least one solution of a solvable linear congruency. I recommend referring to any elementary text on number theory to understand existence and construction of a solution formally. However, it is clear that if we consider,
$77x equiv 2 mod13$.
Knowing that $13*6=78$ we can rewrite the equation above as, $78x-x equiv 2+11-11 mod13 implies -xequiv -11 mod13$ which literally translates to is the set of all integers which upon division by 13 leave 11 as a remainder.
these can be represented as $ 13t+11 $ where$ t in BbbZ$ and are all the possible values of $x$.From the original equation we get
$y=frac77(13t+11)-213$
The smallest positive value being $x=11$ at $t=0$ and corresponding value of $y$ being $frac77*11-213=65$
Also note that for any integer $t<0$ we have $ y<0$ and so $(11,65)$ is the least positive integral solution to the equation.
add a comment |Â
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Hint: You can write $$77xequiv 2mod 13$$ and you can solve it like $$xequiv frac277 mod 13$$ and you and add the modul to the numerator $$frac2+13+13+...+1377$$ until we get a whole number.
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
add a comment |Â
up vote
1
down vote
Hint: You can write $$77xequiv 2mod 13$$ and you can solve it like $$xequiv frac277 mod 13$$ and you and add the modul to the numerator $$frac2+13+13+...+1377$$ until we get a whole number.
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
add a comment |Â
up vote
1
down vote
up vote
1
down vote
Hint: You can write $$77xequiv 2mod 13$$ and you can solve it like $$xequiv frac277 mod 13$$ and you and add the modul to the numerator $$frac2+13+13+...+1377$$ until we get a whole number.
Hint: You can write $$77xequiv 2mod 13$$ and you can solve it like $$xequiv frac277 mod 13$$ and you and add the modul to the numerator $$frac2+13+13+...+1377$$ until we get a whole number.
edited Aug 22 at 8:27
answered Aug 22 at 7:55
Dr. Sonnhard Graubner
67.6k32660
67.6k32660
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
add a comment |Â
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
I got that...but don't know how to proceed from that
â user16701
Aug 22 at 8:09
add a comment |Â
up vote
0
down vote
You are looking for an integer $x$ such that $77xequiv2pmod13$.
Also $77equiv-1pmod13$, I think you know how to go on from here.
Hope this helps.
add a comment |Â
up vote
0
down vote
You are looking for an integer $x$ such that $77xequiv2pmod13$.
Also $77equiv-1pmod13$, I think you know how to go on from here.
Hope this helps.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
You are looking for an integer $x$ such that $77xequiv2pmod13$.
Also $77equiv-1pmod13$, I think you know how to go on from here.
Hope this helps.
You are looking for an integer $x$ such that $77xequiv2pmod13$.
Also $77equiv-1pmod13$, I think you know how to go on from here.
Hope this helps.
answered Aug 22 at 7:56
awllower
9,91642471
9,91642471
add a comment |Â
add a comment |Â
up vote
0
down vote
I think for finding an answer we need trial and error but we know that one answer exists when $0le x<13$. One answer is $$x=11\y=65$$and the general answer would become $$x=11+13k\y=65+77k\kinBbb Z$$
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
add a comment |Â
up vote
0
down vote
I think for finding an answer we need trial and error but we know that one answer exists when $0le x<13$. One answer is $$x=11\y=65$$and the general answer would become $$x=11+13k\y=65+77k\kinBbb Z$$
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
add a comment |Â
up vote
0
down vote
up vote
0
down vote
I think for finding an answer we need trial and error but we know that one answer exists when $0le x<13$. One answer is $$x=11\y=65$$and the general answer would become $$x=11+13k\y=65+77k\kinBbb Z$$
I think for finding an answer we need trial and error but we know that one answer exists when $0le x<13$. One answer is $$x=11\y=65$$and the general answer would become $$x=11+13k\y=65+77k\kinBbb Z$$
edited Aug 22 at 8:12
answered Aug 22 at 7:56
Mostafa Ayaz
10.1k3730
10.1k3730
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
add a comment |Â
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
(6,20) is not a solution to the given equation.
â Uday Khanna
Aug 22 at 8:07
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
That's right. Thank you....
â Mostafa Ayaz
Aug 22 at 8:12
add a comment |Â
up vote
0
down vote
For any pair of integers $ x,y$ satisfying the equation we can obtain the congruency $77x equiv 2 mod13$.
As you commented that you don't know how to solve such equations, i'm gonna try and explain them without assuming you know the basic theory behind it.
There is a standard way using divison algorithm successively to obtain at least one solution of a solvable linear congruency. I recommend referring to any elementary text on number theory to understand existence and construction of a solution formally. However, it is clear that if we consider,
$77x equiv 2 mod13$.
Knowing that $13*6=78$ we can rewrite the equation above as, $78x-x equiv 2+11-11 mod13 implies -xequiv -11 mod13$ which literally translates to is the set of all integers which upon division by 13 leave 11 as a remainder.
these can be represented as $ 13t+11 $ where$ t in BbbZ$ and are all the possible values of $x$.From the original equation we get
$y=frac77(13t+11)-213$
The smallest positive value being $x=11$ at $t=0$ and corresponding value of $y$ being $frac77*11-213=65$
Also note that for any integer $t<0$ we have $ y<0$ and so $(11,65)$ is the least positive integral solution to the equation.
add a comment |Â
up vote
0
down vote
For any pair of integers $ x,y$ satisfying the equation we can obtain the congruency $77x equiv 2 mod13$.
As you commented that you don't know how to solve such equations, i'm gonna try and explain them without assuming you know the basic theory behind it.
There is a standard way using divison algorithm successively to obtain at least one solution of a solvable linear congruency. I recommend referring to any elementary text on number theory to understand existence and construction of a solution formally. However, it is clear that if we consider,
$77x equiv 2 mod13$.
Knowing that $13*6=78$ we can rewrite the equation above as, $78x-x equiv 2+11-11 mod13 implies -xequiv -11 mod13$ which literally translates to is the set of all integers which upon division by 13 leave 11 as a remainder.
these can be represented as $ 13t+11 $ where$ t in BbbZ$ and are all the possible values of $x$.From the original equation we get
$y=frac77(13t+11)-213$
The smallest positive value being $x=11$ at $t=0$ and corresponding value of $y$ being $frac77*11-213=65$
Also note that for any integer $t<0$ we have $ y<0$ and so $(11,65)$ is the least positive integral solution to the equation.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
For any pair of integers $ x,y$ satisfying the equation we can obtain the congruency $77x equiv 2 mod13$.
As you commented that you don't know how to solve such equations, i'm gonna try and explain them without assuming you know the basic theory behind it.
There is a standard way using divison algorithm successively to obtain at least one solution of a solvable linear congruency. I recommend referring to any elementary text on number theory to understand existence and construction of a solution formally. However, it is clear that if we consider,
$77x equiv 2 mod13$.
Knowing that $13*6=78$ we can rewrite the equation above as, $78x-x equiv 2+11-11 mod13 implies -xequiv -11 mod13$ which literally translates to is the set of all integers which upon division by 13 leave 11 as a remainder.
these can be represented as $ 13t+11 $ where$ t in BbbZ$ and are all the possible values of $x$.From the original equation we get
$y=frac77(13t+11)-213$
The smallest positive value being $x=11$ at $t=0$ and corresponding value of $y$ being $frac77*11-213=65$
Also note that for any integer $t<0$ we have $ y<0$ and so $(11,65)$ is the least positive integral solution to the equation.
For any pair of integers $ x,y$ satisfying the equation we can obtain the congruency $77x equiv 2 mod13$.
As you commented that you don't know how to solve such equations, i'm gonna try and explain them without assuming you know the basic theory behind it.
There is a standard way using divison algorithm successively to obtain at least one solution of a solvable linear congruency. I recommend referring to any elementary text on number theory to understand existence and construction of a solution formally. However, it is clear that if we consider,
$77x equiv 2 mod13$.
Knowing that $13*6=78$ we can rewrite the equation above as, $78x-x equiv 2+11-11 mod13 implies -xequiv -11 mod13$ which literally translates to is the set of all integers which upon division by 13 leave 11 as a remainder.
these can be represented as $ 13t+11 $ where$ t in BbbZ$ and are all the possible values of $x$.From the original equation we get
$y=frac77(13t+11)-213$
The smallest positive value being $x=11$ at $t=0$ and corresponding value of $y$ being $frac77*11-213=65$
Also note that for any integer $t<0$ we have $ y<0$ and so $(11,65)$ is the least positive integral solution to the equation.
answered Aug 22 at 8:53
Uday Khanna
1577
1577
add a comment |Â
add a comment |Â
4
You are more likely to get help if you show at least some of your own effort...
â Sobi
Aug 22 at 7:44
1
en.wikipedia.org/wiki/Extended_Euclidean_algorithm
â saulspatz
Aug 22 at 7:44
Are you looking for solutions in non-negative integers?
â Henry
Aug 22 at 7:45
Yes, only non-negative
â user16701
Aug 22 at 7:48
1
Search this site, this has been explained here many times already, e.g., here. Compare with the answers.
â Dietrich Burde
Aug 22 at 7:57