What is the largest number of combination bags that Diego can make with no left over? Explain how you know this is the largest possible number of bags?

This question is incomplete

Complete Question

Diego is preparing brownies and cookies for a bake sale. He would like to make equal-size bags for selling all of the 48 brownies and 64 cookies that he has. What is the largest number of combination bags that Diego can make with no left over? Explain how you know this is the largest possible number of bags?

16 bags.

Step-by-step explanation:

From the question, we have:

48 brownies and 64 cookies that he has

Hence, we solve this question using Greatest common factor method.

The first step would be to find the factors of 48 and 64. We would then pick the Greatest (largest factor) common to both.

The factors of 48 are: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

The factors of 64 are: 1, 2, 4, 8, 16, 32, 64

Then the greatest common factor is 16.

Therefore, the largest number of combination bags that Diego can make with no left over is 16 bags

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

the answer is:

the correct option:

b.

to solve the problem, we need to remember how to operate to simplify exponential expressions using the logarithms.

we are given the equation:

then, using placing logarith with base 7 on both sides of the equation, we have:

so, rounding the obtained result to two decimal places (nearest hundreth), we have:

hence, we have that the correct option:

b.

have a nice day!