Q. 1 A4.3( 126 Votes )

# Use Euclid’s division algorithm to find the HCF of900 and 270

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 900 and 270. Clearly 900>270.

By applying division lemma

900 = 270×3 + 90

Since remainder 0, applying division lemma on 270 and 90

270 = 90×3 + 0

remainder = 0,

the HCF of 900 and 270 is 90.

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
Champ Quiz | Fundamental Principle Of Arithmetic41 mins
Euclids Division Lemma49 mins
Fundamental Theorem of Arithmetic- 143 mins
Quiz | Imp Qs on Real Numbers37 mins
NCERT | Imp. Qs. on Rational and Irrational Numbers44 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 :