Euclid’s division lemma/algorithm has several applications related to finding properties of numbers.
We give some examples of these applications below:
If ${a}$ is of the form ${2q}$, then ${a}$ is an even integer. Also, a positive integer can be either even or odd. Therefore, any positive odd integer is of the form ${2q + 1}$.
Since ${0≤ r < 4}$ , the possible remainders are 0, 1, 2 and 3.
That is, ${a}$ can be ${4q}$, or ${4q + 1}$, or ${4q + 2}$, or ${4q + 3}$, where ${q}$ is the quotient. However, since ${a}$ is odd, ${a}$ cannot be ${4q}$ or ${4q + 2}$ (since they are both divisible by 2).
Therefore, any odd integer is of the form ${4q + 1}$ or ${4q + 3}$.
In this problem, we have to find greatest number that divides each one of the following exactly.
So, this is a problem of HCF.
Now, let us use Euclid’s algorithm to find their HCF. We have :
420 = 130 × 3 + 30
130 = 30 × 4 + 10
30 = 10 × 3 + 0
So, the HCF of 420 and 130 is 10.
Therefore, the sweetseller can make stacks of 10 for both kinds of barfi.