use Euclid's algorithms to find HCF …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by A Mariyappan 5 years, 1 month ago
- 1 answers
Related Questions
Posted by Parinith Gowda Ms 2 months, 2 weeks ago
- 1 answers
Posted by Kanika . 4 days, 15 hours ago
- 1 answers
Posted by Sahil Sahil 1 year, 3 months ago
- 2 answers
Posted by Hari Anand 5 months, 1 week ago
- 0 answers
Posted by Vanshika Bhatnagar 1 year, 3 months ago
- 2 answers
Posted by Parinith Gowda Ms 2 months, 2 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
myCBSEguide
Yogita Ingle 5 years, 1 month ago
1445 = 1190*1 + 255
1190 = 255*4 + 170
255 = 170*1 + 85
170 = 85*2 + 0
So, now the remainder is 0, then HCF is 85
Now,
85 = 255 - 170
(1445 - 1190) - (1190 - 255*4)
⇒ 1445 - 1190 - 1190 + 255*4
⇒ 1445 - 1190*2 + (1445 - 1190)*4
⇒ 1445 - 1190*2 + 1445*4 - 1190*4
⇒ 1445*5 - 1190*6
⇒ 1190*(- 6) + 1445*5
1190m + 1445n , where m = - 6 and n = 5
0Thank You