This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (15 points) 3. Let a = 6468 and b = 44590 (a) Compute gcd(a,b) using the prime factorizations of a and b (5 points) (b) Compute gcd(a,b) using Euclidean algorithm. Show intermediate steps. (5 points) 4. Section 4.1 Problem 4 on page 279 (Parts a, b, c, d, f: 2 points, part e: 5 points. Total 15 points) 5. Section 4.1 Problem 32 on page 280 (11 points) 6. Section 4.1 Problem 50 on page 281 (17 points) 7. Section 4.2 Problem 14 on page 292 (17 points) Extra Credit Question: Section 3.6 Problem 30 on page 230 (15 points) Hint: 10 1 (mod 11)...
View
Full
Document
This note was uploaded on 10/21/2011 for the course CSCI 2011 taught by Professor Staff during the Spring '08 term at Minnesota.
 Spring '08
 Staff

Click to edit the document details