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​
asked 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​

asked
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}

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

Related questions

Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
Link Copied!