using clucid ALKONRITHM.FIND HCF
2032 and 4462
Answers
Answered by
0
ksjge siyebsnsis ejdheb esigene ksge weisve e skdu ee uz e eidve
Answered by
0
Step-by-step explanation:
1651 and 2032,
The given integers are 1651 and 2032,
Since 1651<2032,
Apply Euclid's division algorithm to find HCF of 1651 and 2032
2032=(1651∗1)+381
Since the remainder 381=0
Apply Euclid's division algorithm to find HCF of 1651 and 381
1651=(381∗4∗1)+127
Since the remainder 127=0
Apply Euclid's division algorithm to 381 and 127
381=(127∗3)+0
Since the remainder is zero.
∴ HCF of 1651 and 2032 is 127.
Similar questions