Use euclids algirithm to find H.C.F. …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Related Questions
Posted by Sahil Sahil 1 year, 4 months ago
- 2 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 1 answers
Posted by Parinith Gowda Ms 3 months, 2 weeks ago
- 0 answers
Posted by Kanika . 1 month ago
- 1 answers
Posted by Hari Anand 6 months, 1 week ago
- 0 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Vanshika Bhatnagar 1 year, 4 months ago
- 2 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
Neetu Yadav 6 years, 3 months ago
We know that HCF of two numbers can be found by Euclid's Division Algorithm
1445=1190×1+255
1190=255×4+170
255=170×1+85
170=85×2+0
so HCF(1190,1445) is 85
From second last equation
85=255-170
85=255-(1190-255×4)
85=255×5-1190
85=(1445-1190)×5-1190
85=-1190×6+1445×5
85=1190 m+1445n
m=-6
n=5
Hope it helps you.
0Thank You