Use Euclid's algorithm to find HCF of 1651 and 2032 Express the HCF in the form 1651m+2032n - Maths - Real Numbers

Question

Use Euclid's algorithm to find HCF of 1651 and 2032 Express the HCF
in the form 1651m+2032n

Ankita Agarwal · Accepted Answer

Dear Student,

We have to use Euclid's algorithm to find HCF of 1651 and 2032 and express it in the form 1651m+2032nSo applying the theorem, we get2032>16512032=1651×1+381           
11651=381×4+127             
2381=127×3+0Hence, the remainder comes out to be 0
 Hence the H C F  is 127
From equ1, we get381=2032-1651Using this in equ
 2,H C F
 127= 1651-381×41274=16514-3811274=16514-2032-16511274=1651-4×2032+4×16514127=5×1651-4×2032Here, m =5 and n =-4So, 127 = 1651m+2032n

Regards

Use Euclid's algorithm to find HCF of 1651 and 2032 . Express the HCF in the form 1651m+2032n.