-2

This is how I did my proof although Im doubting weather or not I can do this one thing which I will mention explicitly, also (a,b) is the gcd or greatest common divisor, and every lower case letter is an integer.

Proof. Suppose (a,b)= d, then we know that d=ax+by for some x and y (This is a well-known theorem that states that the gcd of a and b is the least element of the set of ax+by so x and y should be numbers such that d is the least element of the set)

$d\cdot c$ = (ac)x+(bc)y

This is where I'm having an issue, I want to say that (ac,bc)=dc by the aforementioned theorem, but for that to be true dc would have to be the least element of the set of acx+bcy, so does multiplying this equation by c preserve this property or can we not know that?

1 Answers1

-1

Ok I think I found a satisfying answer, if we imagine the table of with x,y and d column and then multiply c to everything the acx+bcy for x and y such that d is the lowest element of the set ax+by, then in our new table with xc, yc and dc then acx+bcy would be the least element of the set.

so dc=ac(x)=bc(y) implies dc=(ac,bc)=c(a,b).