Question

2002 cartoons of lassi bottle and 2618 cartoons of Frooti are to be stacked in a store room if each side is of same height and discontent cartoons of same types of bottles what would be the greatest number of cartoons is stack would have?

Answer 1

EUCLID'S DIVISION ALGORITHM :
It is a technique to find the highest common factor of two or more given positive Integers. Here a & b is any two positive Integers.
a = bq +r ,where 0 ≤ r < b

Firstly we have to find HCF of 2002 and 2618 by using Euclid's division algorithm to find the greatest number of cartons each stack would have.

SOLUTION :
By using Euclid's division lemma for 2002 & 2618
2618 =( 2002 ×1) + 616
Here, remainder = 616≠0

On taking 2002 as new dividend & 616 as new divisor & then apply Euclid's division lemma,
2002 =( 616 × 3) + 154
Here, remainder = 154 ≠ 0

On taking 616 as new dividend & 154 as new divisor & then apply Euclid's division lemma,
616 = (154 × 4) + 0
Here, remainder = 0 & the divisor is 154.

HCF of 2002 and 2618 is 154.

Hence, 154 is the greatest number of cartons each stack would have .

HOPE THIS WILL HELP YOU…

Answer 2

Answer:

Lassi bottles-13 Frooti bottles-17

Step-by-step explanation:

First find the HCF(2002,2618) which will be 154

Means 154 cartons will be there.

Now 2002/154

and 2618/154

This is to find no. of bottles in each carton.

Hope it helps

Mark as brainliest..