Unformatted text preview: given for the answer, and 4 points will be given for the algorithm.) 2) (5 pts) Find one pair of integers x and y such that 63x + 13y = gcd(63, 13), using the method shown in class. (Only 1 point will be given for the answer, the rest for using the algorithm.)...
View
Full Document
 Spring '09
 Prime number, Euclidean geometry, Euclidean algorithm, Terry Date, Fundamental theorem of arithmetic

Click to edit the document details