Question

Find the H.C.F of 1651 and 2032 by Euclid divisi
on algorithm.

Answer 1

1651| 2032| 1 
.........1651 
.........------- 
..........381|1651|4 
................1524 
................------- 
................127|381|3 
......................381 
......................----- 
.......................X 
Hence HCF= 127
        
                     OR

2032 = 2 x 2 x 2 x 2 x 127 
1651 = 13 x 127 

HCF is 127

Answer 2

Answer:

according to Euclid division lemma,

2032=1651×1+381

1651=381×4+127

381=127×3+0

therefore, 127 is the largest number that can divide 1651 and 2032.

Thank you.