Math, asked by SHIVAMDHASMANA, 1 month ago

Define Euclid's Division Algorithms

sab mar gaye kya ‽¯\_(ツ)_/¯​

Answers

Answered by XxmichhfuggixX
2

Answer:

Euclid's 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.

Step-by-step explanation:

Brainlist malk kal de leeeeeಥ‿ಥ

Previous Question
Next Question
Similar questions
Math, 20 days ago
The adjacent sides of a parallelogram are 32m and 18m and the height is 20m.Find the perimeter and area of the parallelogram?
Math, 20 days ago
cos Q :SinQ = 3:2 find CosecQ​...
Science, 20 days ago
To information about reasons of avoiding the use of chemical pesticides.Title of the activity ❖ Need and importance of the activity ❖ Planned outline of the activity ❖ Methodology of the activity ❖ Observations ❖ Inferences/Conclusion ❖ Your opinion about the activity​...
English, 1 month ago
1 pol 26. O By mixing Acid into Water O By mixing Water into Acid Ο Ο Mixing of Acid and Water at same time​...
Physics, 1 month ago
covert the have force of 50 dyne on to newton by the metho? of dimensiona analyses ​...
Science, 9 months ago
The output of the charge controller is​...
English, 9 months ago
make a pictorial representation on the chapter the old man and the sea.Please I dont want the answer I just want to get ideas.Please answer I'll mark you as brainliest.please....​
English, 9 months ago
how dose the project benefit the students of west bengal? question by 'sabuj sathi' paragraph​...