![]() |
Project
B12 |
Referring to the last problem, what can be said, in general, about the number of paths required to complete Star(n,d)? Be sure that your entire answer fits in the box shown below. We will use the word orbit to describe a complete trip around a circle. For example, we needed 1 orbit to complete a single path of Star(8,2), and 3 orbits to complete a single path of Star(8,3). Experiment with several stars and then explain how the concept of least common multiple can be used to determine the number of orbits required to complete a single path of Star(n,d). Test your idea on Star(5,2), Star(15,6), Star(24,8), Star(15,9), and Star(24,16). Revise your answer above if necessary.