: H. C. F of two numbers by Euclid's division algorithm (geometrically) : Students are given activity to find HCF of two numbers using EDA in which different rectangular strips will be used as dividends, divisors and remainders. In each step the dividend strip was to be covered with divisor strip(s) until it covers the dividend strip completely. In this process the last divisor strip through which the last dividend will be covered completely is the HCF of the given two numbers. Lab activities
Answers
Answered by
1
Answer:
hcf can be given by a formula a=bxq+r
Similar questions