Carly is packing treats for the chess club. She has 48 nut bars and 64 tangerines. She wants to make snack bags with exactly the same treats for each club member. All the treats are used. What is the greatest number of treat bags she can make? How many of each kind of treat is in 1 sack
find LCD
64 = 8*8 = 4*16
48 = 8*6 = 3*16
so 16 bags each 4 tans and 3 nuts
I mean largest common denominator
To find the greatest number of treat bags Carly can make, we need to determine the greatest common divisor (GCD) of the number of nut bars and the number of tangerines.
Let's find the GCD of 48 and 64. One way to do this is to list the factors of both numbers and find their common factors:
Factors of 48: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
Factors of 64: 1, 2, 4, 8, 16, 32, 64
From this list, we can see that the greatest common factor of 48 and 64 is 16.
Therefore, Carly can make 16 treat bags.
To determine the number of each kind of treat in one bag, we need to divide the total number of treats by the number of bags.
48 nut bars divided by 16 bags = 3 nut bars per bag
64 tangerines divided by 16 bags = 4 tangerines per bag
Thus, there would be 3 nut bars and 4 tangerines in each bag.