Question

bonnie volunteers to bring bags of candy to her childs class for the halloween party this year. she buys one bag of candy a containing 200 pieces of candy, one bag of candy b containing 280 pieces of candy, and one bag of candy c containing 520 pieces of candy. she needs to use all the candy to create identical treat bags. how many treat bags can bonnie make so that each one has the same number and variety of candy? how many of each type of candy will be in each bag?

answer
no. of identical treat bags:
no. of pieces of candy a:
no. of pieces of candy b:
no. of pieces of candy c:

Explanation:

Identify the given values and objective

We are given three quantities of candy:

• Candy A: \(200\) pieces
• Candy B: \(280\) pieces
• Candy C: \(520\) pieces

We need to find the greatest number of identical treat bags Bonnie can make using all the candy, and how many of each type of candy will be in each bag.

Find the greatest common divisor

Using the Greatest Common Divisor Applications knowledge point

$$
LATEXBLOCK0
$$

The maximum number of identical treat bags is \(40\).

Calculate the candy per bag

Using the Greatest Common Divisor Applications knowledge point

$$
LATEXBLOCK1
$$

Answer:

Bonnie volunteers to bring bags of candy to her child's class for the Halloween party this year. She buys one bag of candy A containing 200 pieces of candy, one bag of candy B containing 280 pieces of candy, and one bag of candy C containing 520 pieces of candy. She needs to use all the candy to create identical treat bags. How many treat bags can Bonnie make so that each one has the same number and variety of candy? How many of each type of candy will be in each bag?

No. of identical treat bags: <blank>40</blank>
No. of pieces of candy A: <blank>5</blank>
No. of pieces of candy B: <blank>7</blank>
No. of pieces of candy C: <blank>13</blank>