Use euclid division algorithm to find …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Related Questions
Posted by Vanshika Bhatnagar 1 year, 4 months ago
- 2 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 1 answers
Posted by Hari Anand 6 months, 1 week ago
- 0 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 4 months ago
- 2 answers
Posted by Kanika . 1 month ago
- 1 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
myCBSEguide
Sia ? 6 years, 6 months ago
Given numbers are 957 and 1280 and remainder is 5 in each case.Then , new numbers after subtracting remainders are
957 – 5 = 952 and 1280 – 5 = 1275
Now, by using Euclid's Division lemma , we get
1275 = (952 × 1) + 323
Here remainder = 323
So, on taking 952 as dividend and 323 as new divisor and then apply Euclid's Division lemma, we get
952 = (323 × 2) + 306
Again, remainder = 306.
So, on taking 323 as dividend and 306 as new divisor and then apply Euclid's Division lemma, we get
323 = (306 × 1) + 17
Again, remainder = 17.
So, on taking 306 as dividend and 17 as new divisor and then apply Euclid's Division lemma, we get
306 = (17 × 18) + 0
Here, remainder = 0.
Since, remainder has now become zero and the last divisor is 17.
Therefore, HCF of 952 and 1275 is 17.
0Thank You