Math, asked by blackbear263, 1 year ago

Explain euclidean division lemma

Answers

Answered by sonabrainly

The basis of the Euclidean division algorithm is Euclid's division lemma. 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.

Previous Question

Next Question

Similar questions

Math, 7 months ago

21 a) Diagonals of rhombus are of lengths 10 cm and 24 cm. Find its side. (2) b) Write any two properties which differentiate a rhombus from parallelogram. (2) (Non-anonymous question ) (4 Points)...

Math, 7 months ago

which of the following are not the sides of right angle triangle a) 6cm,8cm,10cm b) 15cm,17cm,8cm c) 5cm,8cm,11cm...

Math, 7 months ago

the value of 2/ $2 \ \sqrt{5 - \sqrt{3} } }$ ...