#Extended Euclidean Algorithm

12 messages · Page 1 of 1 (latest)

wet pilot
#

,rotate

winged yachtBOT
wet pilot
#

Yes, 6 is a multiple of 3

halcyon flame
wet pilot
#

think about it

#

you can get ones that are equal to 3

#

how can you use that together with the fact that 6 is a multiple of 3 to obtain the equation you want?

knotty berry
#

What are you tryna do melo

#

30 = 9(3)+3
9 = 3(3)
So gcd(30 , 9) = 3

halcyon flame
knotty berry
wet pilot
#

@halcyon flame
Think on a simpler example:
We have gcd(2, 3) = 1 and so there are integers s and t with
2t + 3s = 1
In fact, 2*(-1) + 3*1 = 1.

Can you use this to find integers x and y such that
2x + 3y = 6 ?
(note that 6 is a multiple of 1, same situation)