Solution Found!
Let a and b be positive integers and let d = gcd(a, b) and
Chapter 0, Problem 10E(choose chapter or problem)
QUESTION:
Let a and b be positive integers and let d = gcd(a, b) and m = lcm(a, b). If t divides both a and b, prove that t divides d. If s is a multiple of both a and b, prove that s is a multiple of m.
Questions & Answers
QUESTION:
Let a and b be positive integers and let d = gcd(a, b) and m = lcm(a, b). If t divides both a and b, prove that t divides d. If s is a multiple of both a and b, prove that s is a multiple of m.
ANSWER:Step 1 of 2
Let and, therefore it follows:
for some and .
Let is assume that there is a number which is a factor of both and so it follows:
Therefore it follows:
So divides .