Ask your own question, for FREE!
Mathematics 11 Online
OpenStudy (davidusa):

MEDAL PLEASE HELP

OpenStudy (davidusa):

A machine needs to be programmed to lay a single, continuous line of glue covering all of the segments of the pattern shown. The letters identify where the glue path can change direction. There is only one ending point for any path that starts at G, covers all segments, and never retraces any segment. At what point will every such path end? I will add a picture.

OpenStudy (davidusa):

|dw:1393877540420:dw|

OpenStudy (davidusa):

So there it is.

OpenStudy (davidusa):

ill close it. bit ill still check back. i have another more urgent question.

OpenStudy (davidusa):

i mean but

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!