Answer
Verified
392.9k+ views
Hint: First we recall Euclid's algorithm; we can calculate the HCF of two integers by using Euclid’s division algorithm. First assume the greater number as $ a $ and smaller number as $ b $ . Now, express the numbers in the form of $ a=bq+r $ where, $ q\And r $ are unique integers. We follow the same procedure until we get remainder zero.
Complete step-by-step answer:
We have given that numbers $ 1651 $ and $ 2032 $ .
We have to find the HCF by using Euclid’s algorithm.
Now, we compare both numbers, we get
$ 2032>1651 $
Let us assume $ 1651=b $ and $ 2032=a $ .
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 2032=\left( 1651\times 1 \right)+381 $
As $ 381\ne 0 $, we repeat the same process with $ 1651 $ and $ 381 $.
Now, assume $ 1651=a $ and $ 381=b $.
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 1651=\left( 381\times 4 \right)+127 $
As $ 127\ne 0 $ , we repeat the same process with $ 381 $ and $ 127 $ .
Now, assume $ 381=a $ and $ 127=b $ .
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 381=\left( 127\times 3 \right)+0 $
Since the remainder is zero, we can not proceed further.
The HCF of $ 1651 $ and $ 2032 $ is $ 127 $.
Note: The basis of Euclid’s algorithm is Euclid’s division Lemma. The word Lemma is already a proven statement used to prove other statements. On the other hand, an algorithm is a set of steps used to solve a problem. Euclid’s division lemma is used to prove other theorems. Euclid’s division algorithm is follows the form:
$ \text{Dividend=}\left( \text{Divisor}\times \text{Quotient} \right)+r\text{emainder} $
Complete step-by-step answer:
We have given that numbers $ 1651 $ and $ 2032 $ .
We have to find the HCF by using Euclid’s algorithm.
Now, we compare both numbers, we get
$ 2032>1651 $
Let us assume $ 1651=b $ and $ 2032=a $ .
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 2032=\left( 1651\times 1 \right)+381 $
As $ 381\ne 0 $, we repeat the same process with $ 1651 $ and $ 381 $.
Now, assume $ 1651=a $ and $ 381=b $.
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 1651=\left( 381\times 4 \right)+127 $
As $ 127\ne 0 $ , we repeat the same process with $ 381 $ and $ 127 $ .
Now, assume $ 381=a $ and $ 127=b $ .
Now, expressing the numbers in the form $ a=bq+r $ , we get
$ 381=\left( 127\times 3 \right)+0 $
Since the remainder is zero, we can not proceed further.
The HCF of $ 1651 $ and $ 2032 $ is $ 127 $.
Note: The basis of Euclid’s algorithm is Euclid’s division Lemma. The word Lemma is already a proven statement used to prove other statements. On the other hand, an algorithm is a set of steps used to solve a problem. Euclid’s division lemma is used to prove other theorems. Euclid’s division algorithm is follows the form:
$ \text{Dividend=}\left( \text{Divisor}\times \text{Quotient} \right)+r\text{emainder} $
Recently Updated Pages
what is the correct chronological order of the following class 10 social science CBSE
Which of the following was not the actual cause for class 10 social science CBSE
Which of the following statements is not correct A class 10 social science CBSE
Which of the following leaders was not present in the class 10 social science CBSE
Garampani Sanctuary is located at A Diphu Assam B Gangtok class 10 social science CBSE
Which one of the following places is not covered by class 10 social science CBSE
Trending doubts
A rainbow has circular shape because A The earth is class 11 physics CBSE
Which are the Top 10 Largest Countries of the World?
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
How do you graph the function fx 4x class 9 maths CBSE
Give 10 examples for herbs , shrubs , climbers , creepers
The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths
Why is there a time difference of about 5 hours between class 10 social science CBSE
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Difference Between Plant Cell and Animal Cell