English, asked by Anonymous, 8 hours ago






what is Euclid division algorithm​

Answers

Answered by itzminglesoul
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

Answered by Goldenstar06
1

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.

Previous Question
Next Question
Similar questions
Math, 4 hours ago
Simplify. (a) (1/3)-3x (3)-1x1/9 Answer the question brainly users​...
Math, 4 hours ago
the sum of 3/16, 2/5...
Science, 4 hours ago
a boy pushing a truck uses his energy to do this work but the truck donot move at all can you still say that boy is doing work ?why?​
Math, 8 hours ago
(2x - y)(2x + y) what is the answer for this question...
English, 8 hours ago
please help me by answering these questions​...
Science, 7 months ago
A very smooth surface causes more wear and tear. True or false?​
Math, 7 months ago
00550595 de here were three candidates in an election. They received 687905 votes, 495086 votes and 93756 votes respectively. The number of invalid votes was 13849. If 25467 persons did not vote, find how many votes were registered. 5. A survey conducted on an indian state shows that 1623546 people have only primary education: 9768678 people have secondary education: 6837954 people have higher...
Math, 7 months ago
if the number 2^2 * 5^4 * 4^6 * 10^8 * 6^10 * 15^12 * 8^14 * 20^16 * 10^18 * 25^20 is divisible by 10^n, then which one of the following is the maximum value of n...