Answer
Verified
386.3k+ 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
How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE
Mark and label the given geoinformation on the outline class 11 social science CBSE
When people say No pun intended what does that mea class 8 english CBSE
Name the states which share their boundary with Indias class 9 social science CBSE
Give an account of the Northern Plains of India class 9 social science CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Trending doubts
Which are the Top 10 Largest Countries of the World?
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
Difference Between Plant Cell and Animal Cell
Give 10 examples for herbs , shrubs , climbers , creepers
Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE
The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths
How do you graph the function fx 4x class 9 maths CBSE
Write a letter to the principal requesting him to grant class 10 english CBSE