angeldevil3385 angeldevil3385
  • 16-08-2021
  • Mathematics
contestada

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

Respuesta :

caylus
caylus caylus
  • 16-08-2021

Answer:36

Step-by-step explanation:

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

[tex]\begin{array}{c|c|c|c|c|c}&0&1&1&5&2\\468&864&468&396&72&\boxed{36}\\468&396&72&36&0\\\end{array}[/tex]

Answer Link

Otras preguntas

10 + 8(2x+4) = 8 - x
How do you do One-Step Equations?
why did islam prohibit the depiction of people or animals in religion art
Cathrine has £7000 to invest. She decides to invest it for 5 years at a rate of 4% per annum. How much will she have after 5 years if she invests it at compoun
who was the 44 president of the united states of América
What town is the geographical center of British Columbia Canada?
what happen when new civilizations can into contact with each other
Kenya exchanges $200 for euros (€). Suppose the conversion rate is €1 = $1.321. How many euros should Kenya receive?
The indirect object always come between ________
Two years of local internet service costs $685, including the installation fee of $85. What is the monthly fee?