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

Which of the following was one of Adams' initiatives while president? A) destroying the Bank of the United States B) protecting the land of Native America
Struggling un this section
In Florida can you be jailed for a first-time DUI offense?
Look for a pattern in the table to determine which model best describes the data
A publisher needs to send many books to a local book retailer and will send the books in a combination of small and large boxes. Each small box can hold 20 book
Some people with spinal cord injuries do not sweat below the area of the injury. Without the ability to sweat, the human body temperature begins to rise. Which
In a scattered protest think about the authors structure their article. Why is this structure effective?
What percent of time does marissa spend playing basketball ? Show or explain how you got your answer? Walking 45percent Jogging 15 percent Swimming 10 percent
Marcos prefiere ____ con su padre. vivir visita habla vive
I have been asked this question and I substituted the value of x in f with g(x), and rearranged the equality but is incorrect. ​