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 :

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

Which groups contain both primary and secondary consumers?

What is a participial phrase

3x-3(x+1)=3 solve for x

what does phhobia means?

Please help me out with this

1. El vendedor ____ el precio a los clientes. le dice les dice le pregunta les pregunta 2. Ahora mismo mi mamá está en una tienda. ____ un mensaje electró

need to write a letter about holiday abroad is bad for the environment

If there are 100 postage stamps in a sheet of stamps, and each stamp cost 29 cents, how much will one sheet of stamps cost?

Please Help!! Math Question!

Yogurt has an approximate pH of 5 and vinegar has an approximate pH of 3. How many times more acidic is vinegar compared to yogurt in terms of concentration?