Question

1. Let a and b be integers, not both zero. Show that ged(a, b) 1 if and only if there exist integers u and v with ua + vb-1

Note: The answer is a full proof.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

I have try to explain even small small things.Hope you understand the proof.

First Part is Easy but you have to think a little for thesecond one.

Kindly Thumbs Up!!!!!

we have to breove -that ed Cab)) (heod- ut ?f faasl bto (g.cd (a, b) = ol. 오let au +DV-) d) ol dividles other ラUzing@i① Conveり,9) acco e serbset of Nocveal Numbeis excluding zeseo By defmitter, we can find uo,Voorītegoes, such that If we prove that dmus, we concludo that d cli fel。人tas Similary, by same-thin d diu Logic)

Add a comment
Know the answer?
Add Answer to:
Note: The answer is a full proof. 1. Let a and b be integers, not both...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT