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

situations with both _____ produce the highest risk of conflict.
athens' premier philosopher and proponent of cross examination and inductive reasoning was:_____.
fill in the blanks to complete the passage about sexual orientation.
For the purpose of discussing official statistics concerning persons under the age of 18, we should note that little official action is taken with respect to de
If a subclass constructor does not explicitly call a superclass constructor,A)The superclass fields will be set to the default values for their data typesB)Java
the field of human development is considered to be an applied discipline because:___.
A nurse is caring for a client who has a new diagnosis of pernicious anemia. The nurse should expect the clients provider to prescribe which of the following me
Which of the following statements is a valid generalization regarding the properties of smooth muscle?a) Neurotransmitters can either excite or inhibit smooth m
find the 14th term of the geometric sequence 6,18,54,162
9. Carl will roll 2 dice and then multiply their outcomes. How many different ways could the product be an even number?