Find the H. C. F of the 300 and 550 by using euclid division algorithm
Answers
Answered by
6
The numbers 550 and 300 ( we can change the order, that doesn't really matter )
The HCF ( Highest Common Factor ) of the given numbers
First, let's understand the Euclid's Division Algorithm. If :
D = Dividend
I = Divisor
Q = Quotient
R = Remainder
Dividend = Divisor × Quotient + Remainder
=》 D = I × Q + R
For finding the HCF, what we need to do is, we'll first divide the numbers and keep the respective values in this equation. Next, we will take the value of the Divisor (I) and the Remainder (R) from the formed equation and then keep them as the Dividend (D) and the Divisor (I) respectively. This needs to be continued till we get 0 as the remainder. The Divisor (I) of the last equation will be the HCFof the numbers.
Now that we've understood the method, we'll start with solving the question.
I'll simply solve the question, as I've explained the method previously.
Remainder > 0, Continue doing it
=》
Remainder > 0, Continue doing it
=》
Remainder = 0, Divisor = 50
Note : In exams, you just need to show the "Solution" part of this answer in your answersheet. Others are just for your understanding.
Thus, the
S4MAEL:
splendid
Similar questions