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

The graph of y = x2 - 4x is shown on the grid.By drawing the line y = x -4,solve the equations: y = x²- 4xy=x-4x=1 y=...orx=... y=...​
What was one of the first rocks ever formed? Is it still popular today?
In a family, the probability that a child is female is 0.6. if there are thee children in the family, what is the probability that 1. Exactly 2 are girls 2. At
What is 1(y), when y=-7/12?
Mettez ce,cette,cet, ou ces dans les tirets.1. ____ homme est gentil.2.____ petite fille est ma nièce. 3. J'aime _____ garçon parce qu'il est beau.4. ____ hôpit
how to do this question plz ​
Empathy and cooperation is very important in a country like nepal.Elaborate the statement​
0.6y + 0.8 = 0.28y + 1.12
¿Cuál de las siguientes oraciones NO es verdadera?
What is the measure of ∠x