Unformatted text preview: r is produced by the algorithm. NOTE: you should be able to do this by hand, without a computer or calculator. A. gcd (103927 , 102313) B. gcd (145393 , 82933) 3. (10 points) Give an algorithm that on input integers x and m computes x 37 mod m . As a primitive step you may assume an algorithm for modular multiplication: on input y and z it computes ( y · z ) mod m . Your algorithm should use as few modular multiplications as possible (7 is the best possible). You may write the algorithm informally. 4. (5 points) Problem 18 (Chapter 6.8) 5. (5 points) Problem 12 (Chapter 6.8)...
View
Full Document
 Fall '10
 GAL
 Division, Remainder, Natural number, Greatest common divisor, Euclidean algorithm

Click to edit the document details