Math, asked by shahid21727, 9 months ago

Use Euclid's division algorithm to find the HCF of;
(a) 130 and 220​

Answers

Answered by Mehtasaab97
1

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Previous Question
Next Question
Similar questions
Geography, 4 months ago
Sometimes human scarcity is caused by human action. Describe a time when this has occurred. please answer this correctly and if you don't will delete your answer. But if you do, I will mark you the brainliest. :)...
Chemistry, 4 months ago
how can we achieve balance in nature​...
Math, 4 months ago
24. Find the future value of annuity of Rs. 1,000 made annually for 7 years at interest rate of 14% compounded annually. Given that (1.14)7 = 2.5023 (a) 10,730.7 (b) 5,365.36 (c) 8,756 (d) 9,892.34​...
Biology, 9 months ago
How many parts of stomach are there in cows​...
English, 9 months ago
(i) My aunt went to Delhi in the holidays. (Rewrite the sentence in nega (ii) She likes coffee. (Rewrite the sentence in interrogative) Your mother cooking. (Frame a question using appropriate word 'Is​...
History, 1 year ago
Are this your answers ........ they are just fav....
Biology, 1 year ago
What are plastids? Mention the different types of plastids and their functions.
Social Sciences, 1 year ago
Why is there uneven distribution of population in Nepal...