Using the basic form of Euclid’s algorithm, compute the greatest common divisor of

1. 7469 and 2464

2. 2689 and 4001

For this problem use only a pocket calculator. Show every iteration step of Euclid’s algorithm, i.e., don’t write just the answer, which is only a number. Also, for every gcd, provide the chain of gcd computations, i.e.,

Alpha Geek

(8)

Status NEW Posted 17 May 2017 01:05 PM My Price 8.00

-----------

Attachments

1495026070-2059196_1_636305182294294502_gcd.pdf

Not Rated(0)

• Buy Answer