Solution Found!

Let a and b be positive integers and let d = gcd(a, b) and

Chapter 0, Problem 10E

(choose chapter or problem)

Get Unlimited 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.

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 .

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back