The answer is forty inches
Answer:
a c e
Step-by-step explanation:
Answer:
False
Step-by-step explanation:
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 = 
Yes it is.
F1 = k q1 * q2 / r^2
F2 = k *(2*q1) * (4.8 q2) / (7.2 r^2)
Work on F2 for a moment.
F2 = k * 9.6 (q1*q2) / 51.84
F2 = (9.6/ 51.84) * k * q1 * q2 / r^2
Since k * q1 * q2/r^2 is the same in both questions let kq1*q2/r^2 = m
F1 = m
F2 = 0.18 m
So to make it easier F2/F1 = 0.18m / m
F2/ F1 = 0.18 the m's cancel.
And that should be how you do the question.