use euclid's division algarthm to find the hcf of
Answers
Answered by
1
Answer:
yes which no........
Step-by-step explanation:
please MARK AS BRAINLIST
Answered by
0
Answer:
To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers. That means, on dividing both the integers a and b the remainder is zero.
Similar questions