15022002
Euclid division algorithm is a technique to compute the higest comman factor of two given positive integers For eg:455=42×10+5 42=35×1+7 35=7×5+0
0 votes Thanks 0
parul32
As euclid's division leema is a technique to compute the highest common factor (HCF) of two given positive integers.
example : hcf of 420 and 130 420 = 130 × 3 + 30 130 = 30 × 4 +10 30 = 10 × 3 +0
Answers & Comments
For eg:455=42×10+5
42=35×1+7
35=7×5+0
example : hcf of 420 and 130
420 = 130 × 3 + 30
130 = 30 × 4 +10
30 = 10 × 3 +0
so hcf is 10