+0  
 
0
75
4
avatar+80 

Use the Euclidean algorithm to find integers x and y such that 164x + 37y = 1. State your answer as a list with x first and y second, separated by a comma.

 Aug 2, 2020
 #1
avatar
0

idk how to silve it, try doing something with ax+bx = gcd(a,b), it might help.

Also, can you please solve my problem, too? Its the latest one that says help.

 Aug 2, 2020
 #2
avatar+80 
+1

if u dont know how to solve it can you not reply because it's misleading and now others think that this question is solved. thanks

toodlestraws  Aug 2, 2020
 #3
avatar+1042 
+3

I'm no pro at modular arithmetic, but here is a link that my help; https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm

 

You could find the GCF, and then use that to come up with values for x and y?

 

Also, you could ask a mod or other genius users like EP and heureka (just to name a few. Everyone is smart in their own way :D)  about this question by linking this question into a private message to them.

 

:)

ilorty  Aug 2, 2020
edited by ilorty  Aug 2, 2020
edited by ilorty  Aug 2, 2020
 #4
avatar+25541 
+1

Use the Euclidean algorithm to find integers x and y such that 164x + 37y = 1.
State your answer as a list with x first and y second, separated by a comma.

 

My answer see here: https://web2.0calc.com/questions/pls-help-again#r2

 

laugh

 Aug 3, 2020

29 Online Users

avatar
avatar
avatar
avatar