Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 4 - Elementary Number Theory and Methods of Proof - Exercise Set 4.8 - Page 226: 28

Answer

See below.

Work Step by Step

Let $a,b$ be any integer, suppose $c=gcd(a,b)$, we can write $a=mc, b=nc$ where $m,n$ are integers without common factors greater than 1. We have $lcm(a,b)=lcm(mc,nc)=lcm(m,n)\times c=(mn)c$. Thus we have $c|lcm(a, b)$ and we can reach the conclusion that $gcd(a,b)|lcm(a,b)$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.