use euclids division algorithm to find 296 and 38220
Answers
Answered by
1
the answer is as follows-
Euclid division algorithm is as follows-
a = bq + r
therefore
the last value of b is 4
hence the HCF of the no.s is 4
hope it helps plz mark as brainliest
Euclid division algorithm is as follows-
a = bq + r
therefore
the last value of b is 4
hence the HCF of the no.s is 4
hope it helps plz mark as brainliest
Similar questions