Use euclid's division algorithm to find …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Related Questions
Posted by Lakshay Kumar 5 months, 3 weeks ago
- 0 answers
Posted by Parinith Gowda Ms 9 months, 2 weeks ago
- 1 answers
Posted by Kanika . 7 months, 2 weeks ago
- 1 answers
Posted by Vanshika Bhatnagar 9 months, 2 weeks ago
- 2 answers
Posted by Hari Anand 6 months ago
- 0 answers
Posted by S Prajwal 3 months, 3 weeks ago
- 0 answers
Posted by Parinith Gowda Ms 9 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
Sia ? 5 years, 9 months ago
2032 = 1651 × 1 + 381 .
1651 = 381 × 4 + 127
381 = 127 × 3 + 0.
Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.
∴ HCF (1651, 2032) = 127.
Now,
1651=381×4+127
⇒127=1651−381×4
⇒127=1651−(2032−1651×1)×4 [from 2032 = 1651 × 1 + 381]
⇒127=1651−2032×4+1651×4
⇒127=1651×5+2032×(−4)
Hence, m = 5, n = -4.
3Thank You