Register

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

Using Euclids division algorithm, find the largest number that divides 475 and 871 leaving 7 as the remainder in each case​
10.9k views
5 votes
using Euclids division algorithm, find the largest number that divides 475 and 871 leaving 7 as the remainder in each case​

User Jonas Pedersen
by
8.1k points

1 Answer

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}

User Taras Tsugrii
by
8.5k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories

Other Questions

i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
Write words to match the expression. 24- ( 6+3)
A dealer sells a certain type of chair and a table for $40. He also sells the same sort of table and a desk for $83 or a chair and a desk for $77. Find the price of a chair, table, and of a desk.
Link Copied!