{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Discrete Computational Structures, CSE 2353, Fall 2009 Quiz # 3, 100 Points 1. [50] Write each call of the Extended Euclid algorithm with its arguments and results to compute GCD “d” of (72, 99) as well as the coefficients “x” and “y” such that d = 72x + 99y. 2. [50] Find the factors of 572 using Fermat’s factoring method....
View Full Document

{[ snackBarMessage ]}