Question

If a, b âˆˆ Z with b â‰ 0, then by the Division Algorithm there exist unique integers q and r with a = bq + r and 0 < r < |b|. It turns out that the following is true: Theorem: gcd(a,b) = gcd(b,r) Prove that gcd(a,b) = gcd(b,r). (This is half of a proof of the theorem. Once you prove the other direction, that gcd(b,r) â‰¤ gcd(a,b), then the proof is complete. I'm not asking you to prove this second half because it's very similar.)

Name: if 6 z with b 0 then by the division algorithm there exist unique integers and with a bq r and 0 r b 1 it turns out that the following is true theorem gedab gedbr prove that gcda6 gcdbr th 12821
Uploaded: 2022-03-31T09:51:55-08:00
Duration: 4 min 37 s
Channel: Maitreya E
Description: if 6 z with b 0 then by the division algorithm there exist unique integers and with a bq r and 0 r b 1 it turns out that the following is true theorem gedab gedbr prove that gcda6 gcdbr th 12821

          If a, b âˆˆ Z with b â‰  0, then by the Division Algorithm there exist unique integers q and r with a = bq + r and 0 < r < |b|. It turns out that the following is true:

Theorem: gcd(a,b) = gcd(b,r)

Prove that gcd(a,b) = gcd(b,r). (This is half of a proof of the theorem. Once you prove the other direction, that gcd(b,r) â‰¤ gcd(a,b), then the proof is complete. I'm not asking you to prove this second half because it's very similar.)

if 6 z with b 0 then by the division algorithm there exist unique integers and with a bq r and 0 r b 1 it turns out that the following is true theorem gedab gedbr prove that gcda6 gcdbr th 12821

Added by Elizabeth G.

Elementary and Intermediate Algebra

Alan S. Tussy, R. David Gustafson 5th Edition

Instant Answer

Solved by Expert Maitreya E

03/31/2022

Step 1

We know that gcd(a, b) divides both a and b. Let's denote gcd(a, b) as d. So, we have a = md and b = nd for some integers m and n. Show more…

Show all steps

Thanks for your feedback!

If a, b âˆˆ Z with b â‰ 0, then by the Division Algorithm there exist unique integers q and r with a = bq + r and 0 < r < |b|. It turns out that the following is true: Theorem: gcd(a,b) = gcd(b,r) Prove that gcd(a,b) = gcd(b,r). (This is half of a proof of the theorem. Once you prove the other direction, that gcd(b,r) â‰¤ gcd(a,b), then the proof is complete. I'm not asking you to prove this second half because it's very similar.)