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

A 15-foot ladder is leaning against a 30-foot wall. The bottom end of the ladder is 9 feet from the wall. How many feet above the ground does the ladder touch t

I have a Triangle and I need to find the side BC?

How to find the area of a shaded region if there are two circles inside a square, the area of the square is 60 ( on side is 6 and the other is 10)?

How to find the area of a shaded region if there are two circles inside a square, the area of the square is 60 ( on side is 6 and the other is 10)?

There are 130 red, blue and green marbles in a bag. The ratio of red to blue to green is 5:3:2 respectively. How much marbles in the bag are blue?

what would the answer be? 619-(68+q) and q is 386

What does anno domini mean

Don't need the answer, just how you would solve this: Tobin rows 2 miles per hour faster than her opponent. If it takes Tobin 30 minutes to finish a race, and i

How do spermatogenesis and oogenesis differ in terms of the number of gametes they produce?

Why were the 1936 Olympics important to the Nazi's and what advantages did they bring them