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 - The Fusion of Science and Community**

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)

Loading...

Similar Threads - Prove implies 2m+n | Date |
---|---|

I Proving that an operator is unbounded | Feb 8, 2018 |

I Proving a set is linearly independant | Apr 14, 2017 |

I Proving a property when elements of a group commute | Mar 29, 2017 |

Prove a^2 + b^2 = 3(s^2 + t^2) implies both a and b must are divisible by 3 | Dec 20, 2007 |

**Physics Forums - The Fusion of Science and Community**