I saw this on a website. Prove that if r and s are positive integers with(adsbygoogle = window.adsbygoogle || []).push({});

r > s and gcd(r,s)=1, then gcd(rs , r + s)= 1. I can think of two ways to show this. Using the Euclidean algorithm or by showing that 1 can be a linear combination of rs and r + s. Funny thing...I couldn't do either them. I'm ashamed of myself and now I'm looking for some answers...

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

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!

# More primes

Loading...

Similar Threads for More primes | Date |
---|---|

I Prime Subfiellds - Lovett, Proposition 7.1.3 ... | Apr 14, 2017 |

B Sets and functions that gain more structure with context | Jul 7, 2016 |

I Eigen Vectors, Geometric Multiplicities and more... | Apr 10, 2016 |

What is more efficient, autocorrelation or SSA? | May 2, 2015 |

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