1)Find HCF of 1260 and 240 by using Euclid division lema2)Find HCF of following pairs by using Euclid division lema:a) 30,45,60b) 125,180c) 630,840 About the author Lyla
Euclid algorithm a=bq+r a>B and 0⩽r<b 50 and 70 The positive integers are 50 and 70 70>50 Apply Euclid algorithm to 70 and 50 ∴70=(50∗1)+20 The remainder is 20 Apply Euclid algorithm to 50 and 20 ∴50=(20∗2)+10 The remainder is 10. Apply Euclid algorithm to 20 and 10 ∴20=(10∗2)+0 The remainder is zero. ∴ HCF of 70 and 50 is 10. This is smiler answer by this question help you can solve your question Reply
Euclid algorithm a=bq+r
a>B and 0⩽r<b
50 and 70
The positive integers are 50 and 70
70>50
Apply Euclid algorithm to 70 and 50
∴70=(50∗1)+20
The remainder is 20
Apply Euclid algorithm to 50 and 20
∴50=(20∗2)+10
The remainder is 10.
Apply Euclid algorithm to 20 and 10
∴20=(10∗2)+0
The remainder is zero.
∴ HCF of 70 and 50 is 10.
This is smiler answer by this question help you can solve your question