MATH 406 Midterm: MATH406 HERB-R FALL2006 0101 MID EXAM

• School: University of Maryland
• Department: Mathematics
• Course: MATH 406
• Professor: All

Document Summary

Math 406 - exam 1 - oct. 6, 2006. You may use a 4 function or scienti c calculator. All variables are assumed to be integers: (10) use the euclidean algorithm to compute gcd(300, 282). Show your work: (15) describe all integer solutions of 14x + 10y = 2, (35) find all incongruent solutions for each of the following. Then n is a prime: (20) (a) suppose that ac bc (mod m), and assume also that gcd(c, m) = 1.