Math, asked by shahid21727, 7 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
Chemistry, 3 months ago
वसंतऋतूच्या आगमनाने सृष्टीत होणारे बदल तुमच्या निरीक्षणाने लिहा.​
English, 3 months ago
Are you asking me to give you money? [change in declarative]​...
Biology, 3 months ago
1 all except the Persian slave was clam 2 all except the Persian slave were clam ( which one is correct and why)​...
Biology, 7 months ago
How many parts of stomach are there in cows​...
English, 7 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, 10 months ago
Are this your answers ........ they are just fav....
Biology, 10 months ago
What are plastids? Mention the different types of plastids and their functions.
Social Sciences, 10 months ago
Why is there uneven distribution of population in Nepal...