Clayton4722 Clayton4722
  • 03-07-2019
  • Mathematics
contestada

2. Using the Euclidean Algorithm, Calculate the Greatest Common Divisor of the num- bers 11655 and 11340.

Respuesta :

LammettHash
LammettHash LammettHash
  • 03-07-2019

Only two steps needed:

11,655 = 1*11,340 + 315

11,340 = 36*315 + 0

This shows that [tex]\mathrm{gcd}(11,655,\,11,340)=315[/tex].

Answer Link

Otras preguntas

Justify that the shielding effect of an atom remain constant in a period but atomic size gradually gets smaller (chemistry)
Find the value of the lettered angle b​
14. The probability my daughter will eat her dinner without complaining is 5/7. The probability she will eat her dinner and do her homework all without complain
what is meaning of red and black taekwondo belt​ top the picture ....
What is the molarity of a 17 ml solution used to prepare 65 ml of 2.4 M solution?
State and explain five uses of the metropolitan area network
what points does a legislature have to consider while formulating law?​
C. What is windows operating system? Compare different versions of operating system after 2003
which equation matches this graph?​
Is it true that: If f"(c) > 0, then the slope of the tangent line to the graph of the function at x = c is positive.