Question

Let a and be be in \mathbb{Z}. Show the following. If gcd(a,b)=1, then for every n in \mathbb{Z} there exist x and y in \mathbb{Z} such that n=ax+by.

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

Gin: a and b are in Za and b are ird gcab) here exist integers ez,meh hak Lor n L h an arbitrany element in n-(patg6) -n. (pa

Add a comment
Know the answer?
Add Answer to:
Let a and be be in . Show the following. If gcd(a,b)=1, then for every n...
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