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

Astronomers have just discovered a new object that has appeared to bend space. What aspect of the object is responsible for the effect the object has on the fab

Sophie Bennett has personally paid a total of $6,000 in medical costs this year, which is the out-of-pocket limit listed in her insurance plan. At this point, t

What property should a radioisotope used for dating have? OA. It must be an isotope not commonly found in the fossil. OB. Its half-life should be similar to the

The individual rights interpretation of the right to bear arms is supported by the a. the preamble to the Second Amendment. b. the Commerce Clause. c. United St

In San Francisco there are many restaurants that specialize in a wide variety of cuisines. Patronage at these restaurants is influenced by factors such as taste

If the concentration of fluoride anion and aluminum cation was increased to 5 m, by how much would the measured ecell change?.

In which country did monteverdi live and work?

Why is it significant that there are particular kinds of grammatical errors that children do not make?.

slope: y-intercept: HELPPPPP PLEASE

party planners recommend that, for every eight quests, two orders of appetizers be provided. which function reflects this ratio