Use Euclid division algorithm to find …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Veraiah Kesam 4 years, 10 months ago
- 1 answers
Related Questions
Posted by Parinith Gowda Ms 1 week, 3 days ago
- 0 answers
Posted by Kanika . 1 month ago
- 1 answers
Posted by Sahil Sahil 1 year, 1 month ago
- 2 answers
Posted by Parinith Gowda Ms 1 week, 3 days ago
- 1 answers
Posted by Hari Anand 3 months ago
- 0 answers
Posted by Vanshika Bhatnagar 1 year, 1 month ago
- 2 answers
Posted by Lakshay Kumar 9 months, 3 weeks ago
- 0 answers
myCBSEguide
Trusted by 1 Crore+ Students
Test Generator
Create papers online. It's FREE.
CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
Yogita Ingle 4 years, 10 months ago
Euclid's division lemma :
Let a and b be any two positive
integers .Then there exists two
unique whole numbers q and r
such that
a = bq + r ,
0 ≤ r < b
Now , 900 and 270 , start with the larger integer , that is 900. Apply the
Division lemma , we get
900 = 270 × 3 + 90
270 = 90 × 3 + 0
The remainder has now become zero . Now our procedure stops.
Since the divisor at this stage is 90.
Therefore ,
HCF ( 900 , 270 ) = 90
1Thank You