you are creating identical candy bags using 18 chocolate bars and 30 peanut butter cups. What is the greatest number of bags you can fill using all the candy?
18,30 divisible by 2,3,6,..... anything larger to divide evenly?
It would be 6 because that is the highest factor to divide evenly? I don’t know if I am right lol 😂
It’s 6 it’s not 7 lol this is in a test and I know it’s 6
Math test right? It’s 7
Never mind i got six or three
Just six
It's six. Using prime factorization you will get a match of 3 and 2. Multiply them and it is 6. To further experiment divide each of them by 6 then 7. You will find 6 is the highest number they both go by.
To find the greatest number of bags you can fill using all the candy, we need to find the greatest common divisor (GCD) of the given quantities of chocolate bars and peanut butter cups. The GCD represents the largest possible number of bags that can be evenly filled with both types of candy.
To find the GCD of 18 and 30, we can use the Euclidean algorithm.
1. Divide the larger number (30) by the smaller number (18) and find the remainder.
30 ÷ 18 = 1 remainder 12
2. Since we have a non-zero remainder (12), we now divide the smaller number (18) by the remainder (12).
18 ÷ 12 = 1 remainder 6
3. We repeat step 2 with the new remainder.
12 ÷ 6 = 2 remainder 0
4. The remainder in this step is 0, which means the previous remainder (6) is the GCD of 18 and 30.
Therefore, the greatest number of bags you can fill using all the candy is 6.