Ask your own question, for FREE!
Mathematics 19 Online
OpenStudy (francesca_marie):

I will medal make sure you explain :) You are making necklaces for your friends. You have 72 blue beads and 42 red beads. Each friend will receive an identical necklace, and all beads must be used. What is the greatest number of friends who can receive a necklace? Explain your reasoning. How many of each color bead will each friend receive on the necklace? Explain your reasoning.

OpenStudy (stellabella146):

Do you know what GCF is?

OpenStudy (francesca_marie):

Greatest common factor.

OpenStudy (stellabella146):

So I am gonna use the method for this. what can make 72? |dw:1474056755971:dw|

OpenStudy (stellabella146):

now do you wanna do 42?

OpenStudy (francesca_marie):

I don't know how

OpenStudy (stellabella146):

just say "what can make up 42?" or in other words "What can go into 42?"

OpenStudy (stellabella146):

Here lets get you started. So can 1 go into 42?

OpenStudy (stellabella146):

(just divide)

OpenStudy (stellabella146):

like whats 42 divided by 1? is it a whole number?

OpenStudy (stellabella146):

I can see you are offline so its|dw:1474057108680:dw|

OpenStudy (stellabella146):

thats part A

OpenStudy (stellabella146):

do you get it since I can see you're back now?

OpenStudy (francesca_marie):

okay

OpenStudy (stellabella146):

Now at this part I'm gonna guess. so it asks how many of each color does each friend get. now 72 divided by 6 = 12 and 42 divided by 6 = 7. so I think there is six friends and each will get 12 blue beads and 7 red beads

OpenStudy (stellabella146):

but it makes sense, right? what do you think?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!