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

blood evidence cannot provide physical evidence

What is 1,500 divided by 75

Which system is the solution of the graph?

Numeric data is stored in ___________ for direct processing.String variablesBNumeric variablesCOutputDText

List the state that had both a substantial slave population in 1860 and a large African - American population in 1990

to what major language family does english belong

which two colonies lay between Georgia and Cornwallis’s final destination??

Which word best describes the mood in this excerpt from Little Brother? I got home and made myself a sandwich and logged into the Xnet. It had been a good day.

Two numbers given in certain radix x are (55)x and (64)x . If we add this two numbers, the result is (130)x. What is the radix x?

Which mythical features are present in the beginning of the Maasai