PLEASE FOLLOW THE INSTRUCTIONS:
1. No programming
2. Show all steps
3. Explain your solution process in words
4. Proofs need to be explained primarily in words. If there is a lot
of algebra, explain the process in words as well.
5. ANSWER ALL PARTS OF THE QUESTION
Mathematics Homework Solutions
#27704
Euclid's Algorithm for Greatest Common Divisor
1.
(a) Use the Euclidcan Algorithm to find the greatest common divisor of 13 and 21
(b) Is 13 invertible in Z21? If so, find the reciprocal.
(c) Suppose x and yare integers, what is the minimum positive value for 13x+21y?
Determine all posible values of (x,y) for which the minimum is obtained.
(PLEASE SEE ATTACHMENT FOR EXPLANATION OF EUCLID'S ALGORITHM AND COMPLETE PROBLEM)
Euclid's Algorithm for Greatest Common Divisor is investigated. The solution is detailed and well presented.
What is this?
By OTA - Overall OTA Rating
Shawn Laliberte - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
- Plain text response
- Attached file(s):
- 27704sol.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Factoring - a. Convert (11101)2 to base 16. b. Use the Euclidean algorithm to find gcd(34,21).
- Equality of gcd's - Show that if gcd(a, b) = 1, then gcd(ac, b) =gcd(b, c).
- GCD - Let d be a natural number. Prove that d=gcd(a,b) if and only if gcd(a/d, b/d)=1. Illustrate with an example.
- Euclid's Division Lemma and Fundamental Theorem of Arithmetic - 1. Without assuming Theorem 2-1, prove that for each pair of integers j and k (k > 0), there exists some integer q for which j - qk is positive. 2. The principle of mathematical induction is equivale ...
- Greatest Common Divisors ( GCD ) - 1. Let a, b be positive integers, and write a = qb + r, where q, r are Elements of Z and 0 (= or)< r < b. Suppose that d = gcd(a, b). a) If r = 0 show that d = b. b) If r > 0 show that d = gcd(b, ...
