Here is another problem that I think I may have gotten right. Can someone help me? What do you get?

(85,65)

Printable View

- Sep 23rd 2008, 07:35 AMhelpinmathAnother GCD using Euclid's Algorithm
Here is another problem that I think I may have gotten right. Can someone help me? What do you get?

(85,65) - Sep 23rd 2008, 08:45 AMo_O

So by Euclid's algorithm, (85, 65) = ... = ... ? Can you conclude? - Sep 23rd 2008, 08:54 AMhelpinmath
Sorry I forgot to mention that I have to express it as ma + nb

- Sep 23rd 2008, 09:03 AMo_O
Ok well, we can see that (85,65) = (65,20) = (20,5) = (5,0) = 5.

So, going with what I did in my earlier post:

Just a matter of simplifying.