Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = $\frac{N}{D}$

8 0

3 years ago

Can someone help me with this problem please h + 11/12 = 120 1/2

ira [324]

Your answer would be h=1435/12

8 0

3 years ago

You worked everyday for 5 days. You worked 3 hours in the am and 4 hours in the pm. What is the expression for how many hours di

Lynna [10]

You worked a total of 35 hours that week.
4+3 is 7hours a day times 5 days which is 35.

8 0

3 years ago