I've been reading through the new book "Algebra: Chapter 0" by Aluffi in my spare time, but I can't seem to get this one: Prove gcd(m,n)=1 implies gcd(2m+n,2n)=1 where n is odd.(adsbygoogle = window.adsbygoogle || []).push({});

I know the basic properties of gcd, and also about min{am + bn as a,b in Z} = gcd(m,n) and all that, but I think I'm just missing something fundamental.

Skolem

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prove gcd(m,n)=1 implies gcd(2m+n,2n)=1 (n odd)

**Physics Forums | Science Articles, Homework Help, Discussion**