Q. 1 C4.4( 43 Votes )

# Use Euclid’s division algorithm to find the HCF of1651 and 2032

Euclid’s Division is a method for finding the HCF (highest common factor) of two given integers. According to Euclid’s Division Algorithm, For any two positive integers, ‘a’ and ‘b’, there exists a unique pair of integers ‘q’ and ‘r’ which satisfy the relation:

a = bq + r , 0 ≤ r ≤ b

Given integers 1651 and 2032. Clearly 2032>1651.

By applying division lemma

2032 = 1651×1 + 381

Since remainder 0, applying division lemma on 1651 and 381

1651 = 381×4 + 127

Since remainder 0, applying division lemma on 381 and 127

381 = 127×3 + 0

Since remainder = 0,

the HCF of 1651 and 2032 is 127.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos  Interactive Quiz:Euclid's Division Lemma44 mins  Fundamental Theorem of Arithmetic-238 mins  NCERT | Imp. Qs. on Rational and Irrational Numbers44 mins  Fundamental Theorem of Arithmetic- 143 mins  Champ Quiz | Fundamental Principle Of Arithmetic41 mins  Euclids Division Lemma49 mins  Quiz | Imp Qs on Real Numbers37 mins  Relation Between LCM , HCF and Numbers46 mins  Application of Euclids Division Lemma50 mins  Quiz | Fun with Fundamental Theorem of Arithmetic51 mins
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation view all courses RELATED QUESTIONS :