Respuesta :
Answer:
the largest number of relief supply that can put in a box is [tex]T =7[/tex]
Step-by-step explanation:
From the question we are told that
The number of bottles to divide is [tex]n = 810 \ bottles[/tex]
The number of cans of food is [tex]m = 324 \ cans[/tex]
First we need to find the Highest common factor of 810 and 324
Applying the Euclid algorithm(This method involves subtracting the difference from the smallest number till the differerence is zero )
We have
[tex]810 -324 * 1 =486[/tex]
[tex]486 - 324 * 1 = 162[/tex]
[tex]324 -162 * 1 = 162[/tex]
[tex]162 -162 * 1 = 0[/tex]
Thus the HCF is 162
So the maximum number of boxes is z = 162 boxes
The number of bottles of water in each box is [tex]k = \frac{810}{162} = 5 \ bottles[/tex]
The number of cans of food in each box is [tex]y = \frac{324}{162} = 2 \ cans[/tex]
Thus the largest number of relief supply that be put in the box is
[tex]T = k+ y[/tex]
[tex]T = 5 + 2[/tex]
[tex]T =7[/tex]