Main content

Class 10 math (India)

Get Started
Euclid’s division algorithm

Euclid’s division Lemma states that given positive integers a and b, there exist unique integers q and r satisfying a = b*q + r, 0 ≤ r < b. Euclid's division algorithm gives us a recipe to use this lemma to find the HCF of two numbers. In this lesson, let's learn how to use Euclid's division algorithm to solve problems such as "find the HCF of 1312 and 125".
Start learning