Discrete Math -- GCD proof | Mathematics | Page 1

tidal ridge Dec 12, 2023, 10:04 PM

#

I did this but I am realizing bezout's theorem is not bi-directional so this is wrong. Does anyone know a better way to go about this?

fierce yokeBOT Dec 12, 2023, 10:04 PM

#

junior breach Dec 12, 2023, 10:10 PM

#

I think you can write a=xd, m=yd, b=z where x,y are coprime and yd, z are coprime and then gcd(ab, m)=gcd(xdz, yd)=d*gcd(xz, y) and since x,y are coprime and y,z are coprime it follows that gcd(xz, y)=1

tidal ridge Dec 13, 2023, 12:16 AM

#

junior breach I think you can write a=xd, m=yd, b=z where x,y are coprime and yd, z are coprim...

Ohh i ended up doing this

#

#

I think that is alike to what youa re saying

junior breach Dec 13, 2023, 6:11 AM

#

Nice proof

fierce yokeBOT Dec 13, 2023, 6:21 AM

#

Discrete Math -- GCD proof

#Discrete Math -- GCD proof