Question

A sweet seller has $420$ Rasgullahs and $130$ Laddus. He wants to stack them in such a way that each stack has the same number, and they take up the least area of the tray. What is the number of sweets that can be placed in each stack for this purpose?

Answer 1

HCF:

HCF means the highest common factor of two or more numbers.

Euclid's Division Algorithm:

Given positive integers$a$$\&b$, there exist unique integers $q$ and $r$satisfying $a=bq+r,0\le r<b$

Applying Euclid's Division Algorithm:

Finding HCF of $420\&130$

Since $420>130$ we apply Euclid's division algorithm,

$420=130\times 3+30$.

Since remainder $30$≠$0$ so we have to apply Euclid's division algorithm,

$130=30\times 4+10$.

Since remainder $10$≠$0$ so we apply again Euclid's division algorithm,

$30=10\times 3+0$.

The remainder will be zero so the process stop.

HCF will be $3$.

Hence, The number of sweets that can be placed in each stack for this purpose is $3$.