Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (anonymous):

Using the Euclidean Algorithm or the Extended Euclidean Algorithm, compute d=gcd(42042,1071). Certify that your value of d is correct by showing that the conditions of the GCD Characterization Theorem are satisfied.

OpenStudy (experimentx):

here an example on that. http://en.wikipedia.org/wiki/Euclidean_algorithm#Concrete_example

OpenStudy (experimentx):

http://www.wolframalpha.com/input/?i=gcd%2842042%2C1071%29 |dw:1349762584954:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!