What is uclids division algorithm

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Shiny Siddiquee 5 years ago
- 3 answers
Yogita Ingle 5 years ago
According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r < b.
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. That means, on dividing both the integers a and b the remainder is zero.
Related Questions
Posted by Kanika . 1 month, 1 week ago
- 1 answers
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 1 answers
Posted by Sahil Sahil 1 year, 5 months ago
- 2 answers
Posted by Vanshika Bhatnagar 1 year, 5 months ago
- 2 answers
Posted by Hari Anand 6 months, 2 weeks ago
- 0 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 0 answers

myCBSEguide
Trusted by 1 Crore+ Students

Test Generator
Create papers online. It's FREE.

CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
myCBSEguide
Orange Juice 5 years ago
0Thank You