using Euclids division algorithm, find the largest number that divides 475 and 871 leaving 7 as the remainder in each case

asked Nov 20, 2022 10.9k views

5 votes

8.1k points

Please log in or register to add a comment.

5 votes

Answer:36

Explanation:

gcd(475-7,871-7)=gcd(468,864)=36

$\begin{array}c&0&1&1&5&2\\468&864&468&396&72&\boxed{36}\\468&396&72&36&0\\\end{array}$

Taras Tsugrii answered Nov 24, 2022